-
Notifications
You must be signed in to change notification settings - Fork 3
/
35-Search Insert Position.py
59 lines (56 loc) · 1.38 KB
/
35-Search Insert Position.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
'''
给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引。如果目标值不存在于数组中,返回它将会被按顺序插入的位置。
你可以假设数组中无重复元素。
示例 1:
输入: [1,3,5,6], 5
输出: 2
示例 2:
输入: [1,3,5,6], 2
输出: 1
示例 3:
输入: [1,3,5,6], 7
输出: 4
示例 4:
输入: [1,3,5,6], 0
输出: 0
'''
# by myself
class Solution:
def searchInsert(self, nums, target):
lens = len(nums)
for i in range(lens):
if nums[i] >= target:
return i
return lens
# by myself
class Solution:
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
if target in nums:
return nums.index(target)
elif target > nums[-1]:
return len(nums)
elif target < nums[0]:
return 0
else:
for i in range(len(nums)-1):
if target > nums[i] and target < nums[i+1]:
return i+1
# by others
class Solution(object):
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
i = 0
while nums[i] < target:
i += 1
if i == len(nums):
return i
return i