35. Search Insert Position java solutions

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

Subscribe to see which companies asked this question

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

最简单遍历一遍，

不过题目很明显，可以用二分法。

代码：

public class Solution {
    public int searchInsert(int[] nums, int target) {
        if(nums.length == 0 || nums == null) return 0;
        int low = 0,high = nums.length - 1;
        while(low <= high){
            int mid = (low + high)/2;
            if(nums[mid] == target) return mid;
            else if(nums[mid] < target){
                low = mid + 1;
            }else
                high = mid - 1;
        }
        return low;
    }
}