forked from larissalages/code_problems
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsearch_insert_position.py
More file actions
49 lines (39 loc) · 1.18 KB
/
search_insert_position.py
File metadata and controls
49 lines (39 loc) · 1.18 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
# Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
# You may assume no duplicates in the array.
# Example 1:
# Input: [1,3,5,6], 5
# Output: 2
# Example 2:
# Input: [1,3,5,6], 2
# Output: 1
# Example 3:
# Input: [1,3,5,6], 7
# Output: 4
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
i = int(len(nums)/2)
if nums[i] > target:
while(i >= 0 and nums[i] != target and nums[i] > target):
i-=1
if nums[i] != target:
i+=1
else:
while(i < len(nums) and nums[i] != target and nums[i] < target):
i+=1
return i
# Binary Search
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
l = 0
r = len(nums)-1
while(l<=r):
mid = (l+r)/2
if nums[mid] == target:
return mid
if nums[mid] <= target:
l = mid+1
else:
r = mid-1
return l
index = Solution().searchInsert([1,3,5,6], 5)
print(index)