# 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. """ 给定一个排序数组和一个目标值,如果找到目标,返回索引。如果没有,返回按顺序插入的索引所在的位置。 Input: [1,3,5,6], 5 Output: 2 Input: [1,3,5,6], 2 Output: 1 """ class Solution(object): def searchInsert(self, nums, target): """ :type nums: List[int] :type target: int :rtype: int """ if target > nums[-1]: return len(nums) for i in range(len(nums)): if nums[i] >= target: return i