leetcode035-python 搜索插入位置

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.列表的寻找功能index函数，判断元素是否在列表中a in list。

class Solution:
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        ans = 0
        n = len(nums)
        if target in nums:
            ans = nums.index(target)
            return ans
        else:
            for i in nums:
                if i < target:
                    ans += 1
                else:
                    break
            return ans