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

解题思路：可以通过二分搜索法

Java代码实现：

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

原题题目： https://leetcode.com/problems/search-insert-position/