"""
给定一个按照升序排列的整数数组 nums，和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。

你的算法时间复杂度必须是 O(log n) 级别。

如果数组中不存在目标值，返回 [-1, -1]。

示例 1:

输入: nums = [5,7,7,8,8,10], target = 8
输出: [3,4]
示例 2:

输入: nums = [5,7,7,8,8,10], target = 6
输出: [-1,-1]

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。
"""


from typing import *
import math

def searchRange(nums: List[int], target: int) -> List[int]:
    first, last, start = 0, len(nums) - 1, -1
    while first <= last:
        mid = int((first + last) / 2)
        if nums[mid] == target:
            if mid == first or nums[mid - 1] < target:
                start = mid
                break
            first, last = first, mid
        elif nums[mid] > target:
            first, last = first, mid - 1
        elif nums[mid] < target:
            first, last = mid + 1, last

    if start == -1:
        return [-1, -1]

    first, last, end = 0, len(nums) - 1, -1
    while first <= last:
        mid = math.ceil((first + last) / 2)
        if nums[mid] == target:
            if mid == last or nums[mid + 1] > target:
                end = mid
                break
            first, last = mid, last
        elif nums[mid] > target:
            first, last = first, mid - 1
        elif nums[mid] < target:
            first, last = mid + 1, last

    return [start, end]


if __name__ == '__main__':
    print(searchRange([7, 7, 8, 8], 8))
