-
Notifications
You must be signed in to change notification settings - Fork 1
/
034 Search for a Range.py
55 lines (46 loc) · 1.56 KB
/
034 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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
'''
Given a sorted array of integers, find the starting and ending position of a given target value.
Your algorithm's runtime complexity must be in the order of O(log n).
If the target is not found in the array, return [-1, -1].
For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].
'''
class Solution(object):
def searchRange(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
result = []
length = len(nums)
start = 0
end = length
while start < end:
mid = (start + end) // 2
if nums[mid] == target and (mid == 0 or nums[mid - 1] != target):
result.append(mid)
break
if nums[mid] < target:
start = mid + 1
else:
end = mid
if not result:
return [-1, -1]
end = length
while start < end:
mid = (start + end) // 2
if nums[mid] == target and (mid == length - 1 or nums[mid + 1] != target):
result.append(mid)
break
if nums[mid] <= target:
start = mid + 1
else:
end = mid
return result
if __name__ == "__main__":
assert Solution().searchRange([5, 7, 7, 8, 8, 10], 8) == [3, 4]
assert Solution().searchRange([5, 7, 7, 8, 8, 10], 5) == [0, 0]
assert Solution().searchRange([5, 7, 7, 8, 8, 10], 7) == [1, 2]
assert Solution().searchRange([5, 7, 7, 8, 8, 10], 10) == [5, 5]