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.

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

思路：

与数组中的元素逐个比较，若数组中的某个元素大于或等于它则在钙元素前面插入并返回该下标值。

代码：

class Solution:
    def searchInsert(self, nums, target):
        i = 0
        for num in nums:
            if num >= target:
                ans = i
                break
            else:
                i = i + 1
        ans = i
        return ans