-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbsearch_variants.py
79 lines (58 loc) · 1.69 KB
/
bsearch_variants.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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
# -*- coding: utf-8 -*-
from typing import List
"""
查找第一个值等于给定值的元素的下标
"""
def bsearch_left(nums: List, target: int):
low, high = 0, len(nums)-1
while low <= high:
mid = low + (high - low)//2
if nums[mid] < target:
low = mid + 1
else:
high = mid - 1
return low if nums[low] == target else -1
"""
查找最后一个值等于给定值元素的下标
"""
def bsearch_right(nums: List, target: int):
low, high = 0, len(nums)-1
while low <= high:
mid = low + (high - low)//2
if nums[mid] > target:
high = mid - 1
else:
low = mid + 1
return high if nums[high] == target else -1
"""
查找第一个大于等于给定值的元素
"""
def bsearch_left_not_less(nums: List, target: int):
low, high = 0, len(nums)-1
while low <= high:
mid = low + (high - low)//2
if nums[mid] >= target:
if mid ==0 or nums[mid-1] < target:
return mid
else:
high = mid - 1
else:
low = mid + 1
return -1
"""
查找最后一个小于等于给定值的元素
"""
def bsearch_right_not_less(nums: List, target: int):
low, high = 0, len(nums)-1
while low <= high:
mid = low + (high - low)//2
if nums[mid] <= target:
if mid == len(nums)-1 or nums[mid+1] > target:
return mid
else:
low = mid + 1
else:
high = mid - 1
if __name__ == '__main__':
a = [1,2,3,5,5,6,7,8]
print(bsearch_right_not_less(a, 3))