剑指 Offer 53 - I. 在排序数组中查找数字 I

二分查找 找出target和target-1的右边界即可。

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

作者：xsong-code
链接：https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/solution/jian-zhi-offer-53-i-bao-li-er-fen-jie-ti-4nlq/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。