题目:
统计一个数字在排序数组中出现的次数。
源码:
public class Solution {
public int GetNumberOfK(int [] array , int k) {
if (array.length == 0 || k > array[array.length - 1] || k < array[0] ) {
return 0;
}
int count = 0;
for (int i = 0; i < array.length; i++) {
if (k == array[i]) {
count++;
} else if (k > array[i]) {
continue;
} else {
break;
}
}
return count;
}
}