[DP]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.

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

我用了Python的两个内置函数in和index，in直接判断一个数是不是在数组中，返回bool类型，还有一个index直接返回找的数的下标。

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 nums[len(nums)-1] < target:
            return len(nums)
        else:
            i = 0
            while(nums[i] < target):
                i+=1
            return i