【LeetCode】解题35：Search Insert Position

Problem 33: Search Insert Position [Easy]

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

来源：LeetCode

解题思路

• 顺序搜索直到找到等于target或大于target的位置。
• 没有找到返回N。

时间复杂度O(n)。

Solution (Java)

class Solution {
    public int searchInsert(int[] nums, int target) {
        int N = nums.length;
        for(int i = 0; i < N; i++){
            if(nums[i] >= target) return i;
        }
        return N;
    }
}