Leetcode35 Search Insert Position

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

Solution1

• 最简单的方法当然是一个一个去找了：

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

Solution2

• 二分搜索如下：

public class Solution {
    public int searchInsert(int[] nums, int target) {
        return help(nums,0,nums.length-1,target);
    }
    public int help(int[] nums, int start, int end, int target){
        if(start>end) return start;
        int mid = (start+end)/2;
        if(nums[mid]>target) return help(nums,start,mid-1,target);
        if(nums[mid]<target) return help(nums,mid+1,end,target);
        return mid; 
    }
}

Solution3

• 迭代的二分搜索如下：

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