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

思路

從0位開始順序掃一遍，若當前位的樹大於target，則返回當前位置

（注：改進算法可以用二分法）

代碼

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