题解 | #数字在升序数组中出现的次数#
数字在升序数组中出现的次数
http://www.nowcoder.com/practice/70610bf967994b22bb1c26f9ae901fa2
int count = 0;
public int GetNumberOfK(int [] array , int k) {
int i = 0, j = array.length -1;
while(i <= j && (array[i] != k || array[j] != k)){
if(array[i] < k){
i++;
}
if(array[j] > k){
j--;
}
}
if(i <= j){
return j - i + 1;
}else{
return 0;
}
}
}