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

剑指 Offer 53 - I. 在排序数组中查找数字 I
统计一个数字在排序数组中出现的次数。

示例 1:

输入: nums = [5,7,7,8,8,10], target = 8
输出: 2
示例 2:

输入: nums = [5,7,7,8,8,10], target = 6
输出: 0

限制：

0 <= 数组长度 <= 50000

class Solution {
    public int search(int[] nums, int target) {
       return helper(nums,target)-helper(nums, target - 1);
    }

    int helper(int[] nums, int tar) {
        int l=0;
        int r=nums.length-1;
        while (l<=r) {
            int mid = l + (r-l)/2;
            if (nums[mid] <= tar) {
                l=mid+1;
            }else {
                r = mid-1;
            }
        }
        return l;
    }

}