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

思路：最简单的二分搜索。

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