-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsearch-for-a-range.py
35 lines (32 loc) · 1021 Bytes
/
search-for-a-range.py
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
from typing import List
class Solution:
def searchRange(self, nums: List[int], target: int) -> List[int]:
begin = -1
end = -1
# Find the first occurrence of target in A
front = len(nums) - 1
back = 0
while back <= front:
mid = (front + back) // 2
if nums[mid] > target:
front = mid - 1
elif nums[mid] < target:
back = mid + 1
else:
front = mid - 1
begin = mid
# Target is not found in the array A
if begin == -1: return [-1, -1]
# Find the last occurrence of target in A
front = len(nums) - 1
back = 0
while back <= front:
mid = (front + back) // 2
if nums[mid] > target:
front = mid - 1
elif nums[mid] < target:
back = mid + 1
else:
back = mid + 1
end = mid
return [begin, end]