We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 1d72292 commit 7606bc7Copy full SHA for 7606bc7
search_for_a_range/solution.py
@@ -0,0 +1,26 @@
1
+class Solution:
2
+ # @param A, a list of integers
3
+ # @param target, an integer to be searched
4
+ # @return a list of length 2, [index1, index2]
5
+ def searchRange(self, A, target):
6
+ res = [-1, -1]
7
+ n = len(A)
8
+ l = 0
9
+ r = n - 1
10
+ while l <= r:
11
+ mid = l + (r - l) // 2
12
+ if target == A[mid]:
13
+ res = [mid, mid]
14
+ p = q = mid
15
+ while p >= 0 and A[p] == target:
16
+ res[0] = p
17
+ p -= 1
18
+ while q <= n - 1 and A[q] == target:
19
+ res[1] = q
20
+ q += 1
21
+ break
22
+ elif target < A[mid]:
23
+ r -= 1
24
+ else:
25
+ l += 1
26
+ return res
0 commit comments