-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy path704.binary-search.py
More file actions
49 lines (43 loc) · 1.21 KB
/
704.binary-search.py
File metadata and controls
49 lines (43 loc) · 1.21 KB
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
# Tag: Array, Binary Search
# Time: O(logN)
# Space: O(1)
# Ref: -
# Note: Standard;
# Video: https://youtu.be/oxWpJtUGG_0
# Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.
# You must write an algorithm with O(log n) runtime complexity.
#
# Example 1:
#
# Input: nums = [-1,0,3,5,9,12], target = 9
# Output: 4
# Explanation: 9 exists in nums and its index is 4
#
# Example 2:
#
# Input: nums = [-1,0,3,5,9,12], target = 2
# Output: -1
# Explanation: 2 does not exist in nums so return -1
#
#
# Constraints:
#
# 1 <= nums.length <= 104
# -104 < nums[i], target < 104
# All the integers in nums are unique.
# nums is sorted in ascending order.
#
#
class Solution(object):
def search(self, nums: List[int], target: int) -> int:
start = 0
end = len(nums)
while start < end:
mid = start + (end - start) // 2
if nums[mid] == target:
return mid
elif nums[mid] < target:
start = mid + 1
else:
end = mid
return -1