二分搜索+java

算法讲解——链接 

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