作业13：在排序数组中查找数字 i

题目：

统计一个数字在排序数组中出现的次数。

示例 1:

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

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

提示：

0 <= nums.length <= 105
-109 <= nums[i] <= 109
nums 是一个非递减数组
-109 <= target <= 109

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

//二分法查找
public class SearchNum {
    public static int search(int[] nums,int target){
        int i = 0, j = nums.length-1;
        while(i <= j) {
            int m = (i + j) / 2;
            if (nums[m] <= target) {
                i = m + 1;
            } else {
                j = m - 1;
            }
        }
            int right = i;
            if(j >= 0 && nums[j] != target){
                return 0;
            }
            i = 0; j = nums.length -1;
            while(i <= j){
                int m = (i+j)/2;
                if(nums[m] < target){
                    i = m+1;
                }else{
                    j = m-1;
                }
        }
        int left = j;
        return right - left -1;
    }
    public static void main(String[] args) {
        int[] nums = {5,7,7,8,8,10};
        int target = 8;
        System.out.println(search(nums, target));//答案为2
    }
}