タイトル説明
数値が昇順の配列に現れる回数を数えます。
コード
public class Solution {
public int GetNumberOfK(int [] array , int k) {
int low = 0;
int high = array.length-1;
int mid = (low+high)/2;
int count = 0;
while (high-low == 1 ){
if (array[mid] > k) {
high = mid;
}else if (array[mid] < k){
low = mid;
}else {
break;
}
mid = (low+high)/2;
}
for (int i = low; i <= high; i++) {
if (array[i] == k) {
count++;
}
}
return count;
}
}