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

解题思路：二分查找

public int searchInsert(int[] nums, int target) {        if(target <= nums[0]) return 0;        if(target > nums[nums.length-1]) return nums.length;        int start = 0;        int end = nums.length;        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;            }        }        if(nums[start] < nums[end]){            return end;        }else{            return start;        }    }