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