2018.04.02 leeycode 打卡 #35 . Search Insert Position

#35 Search Insert Position

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.

如果target存在于数组中返回下标，不存在返回应该在的位置。
题目很简单~~class Solution:
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
for i,v in enumerate(nums):
if target <= nums[i] :
return i
return len(nums)