leetcode-solutions/FindFirstandLastPositionofElementinSortedArray.py at master · PawanJaiswal08/leetcode-solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        range_start = -1
        range_end = -1

        if (nums == None or len(nums) == 0):
            return [range_start, range_end]

        start = 0
        end = len(nums) - 1

        while start + 1 < end:
            mid = start + (end - start) // 2
            if nums[mid] < target:
                start = mid
            elif nums[mid] > target:
                end = mid
            else:
                start = mid

        if nums[end] == target:
            range_end = end
        elif nums[start] == target:
            range_end = start

        start = 0
        end = len(nums) - 1

        while start + 1 < end:
            mid = start + (end - start) // 2
            if nums[mid] < target:
                start = mid
            elif nums[mid] > target:
                end = mid
            else:
                end = mid

        if nums[start] == target:
            range_start = start
        elif nums[end] == target:
            range_start = end

        return [range_start, range_end]