查找有序数组中第一个大于target的数字

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

来源：CSDN

作者：k7_silent

链接：https://blog.csdn.net/k7_slient/article/details/103807440