数字在排序数组中出现的次数
题目描述
统计一个数字在排序数组中出现的次数。
方法一:直接遍历,计数
public class Solution {
public int GetNumberOfK(int [] array , int k) {
int count = 0;
for(int i = 0; i < array.length; i++) {
if(array[i] == k) {
count++;
}
}
return count;
}
}
方法二:排序数组,想到二分法
因为有序,想到二分查找。找到待查找值在数组中第一次、最后一次出现的位置,两个位置相减,即为待查找值出现的次数
public class Solution {
public int GetNumberOfK(int [] array , int k) {
if(array == null || array.length == 0)
return 0;
int first = getFirstK(array,k,0,array.length - 1);
int last = getLastK(array,k,0,array.length - 1);
if(first == -1 || last == -1)
return 0;
else
return last - first + 1;
}
private int getFirstK(int [] array, int k, int low, int high){
int mid = 0;
while(low <= high){
mid = low + (high - low) / 2;
if(array[mid] == k){
if(mid > 0 && array[mid - 1] != k || mid == 0)
return mid;
else
high = mid - 1;
}
else if(array[mid] > k)
high = mid - 1;
else
low = mid + 1;
}
return -1;
}
private int getLastK(int [] array, int k, int low, int high){
int mid = 0;
while(low <= high){
mid = low + (high -low) / 2;
if(array[mid] == k){
if(mid < array.length - 1 && array[mid + 1] != k || mid == array.length - 1)
return mid;
else
low = mid + 1;
}
else if(array[mid] > k)
high = mid - 1;
else
low = mid + 1;
}
return -1;
}
}
链接:https://www.nowcoder.com/questionTerminal/70610bf967994b22bb1c26f9ae901fa2?f=discussion
来源:牛客网