LeetCode 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.

You may assume no duplicates in the array.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

题意：

给定一个排序的数组 以及一个目标数，如果目标数在该数组中，则该下标，

否则，返回插入数组中的下标。

题解：

class Solution(object):    def searchInsert(self, nums, target):        """        :type nums: List[int]        :type target: int        :rtype: int        """        if target in nums:            return nums.index(target)        else:            for i in range(len(nums)):                if target < nums[i]:                    return i        return len(nums)   #目标数最大时的情况