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
Example 4:
Input: [1,3,5,6], 0
Output: 0
1.思路
因为是有序的数组,相当于找第一个比指定数大的数,遍历即可
2.Code
class Solution:
def searchInsert(self, nums, target):
if not any(nums):
return 0
flag = 0
for i in range(len(nums)):
if nums[i] >= target:
flag = 1
break
if flag:
return i
else:
return i + 1