forked from das-jishu/algoexpert-data-structures-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex-equals-value.py
51 lines (43 loc) · 1.03 KB
/
index-equals-value.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
# INDEX EQUALS VALUE
# O(N) time and O(1) space
def indexEqualsValue(array):
# Write your code here.
for i, elem in enumerate(array):
if i == elem:
return i
return -1
# O(logN) time and O(1) space
def indexEqualsValue(array):
# Write your code here.
left = 0
right = len(array) - 1
currentMinIndex = -1
while left <= right:
mid = (left + right) // 2
if mid == array[mid]:
currentMinIndex = mid
right = mid - 1
elif array[mid] > mid:
right = mid - 1
else:
left = mid + 1
return currentMinIndex
# O(logN) time and space
def indexEqualsValue(array):
# Write your code here.
return searchMinIndex(array, 0, len(array) - 1)
def searchMinIndex(array, left, right):
if left > right:
return -1
mid = (left + right) // 2
if array[mid] > mid:
return searchMinIndex(array, left, mid - 1)
elif array[mid] < mid:
return searchMinIndex(array, mid + 1, right)
else:
if mid == 0:
return 0
elif array[mid - 1] < mid - 1:
return mid
else:
return searchMinIndex(array, left, mid - 1)