# 原地址 https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/ # 分析 - 在有序数组中查找某个数字出现的个数 - 通过二分法可以得到数字的位置 - 因为是有序的，只要向前遍历查找统计次数即可 # 代码 ```java class Solution { public int search(int[] nums, int target) { int left = 0; int right = nums.length - 1; int count = 0; while (left < right) { int mid = (right + left) / 2; if (target > nums[mid]) { left = mid + 1; } else { right = mid; } } while (left < nums.length && nums[left++] == target) { count++; } return count; } } ```