题目:
统计一个数字在排序数组中出现的次数。例如输入数组{1,2,3,3,3,3,4,5}和数字3,由于3在这个数组中出现了4次,因此输出4。
思路:找到该数字第一次出现的位置与最后一次出现的位置。
public class Test {
public static void main(String[] args) {
int [] data = {1,3,4,4,5};
System.out.println(getNumberOfK(data,4));
}
//返回出现的次数
public static int getNumberOfK(int[] data,int k) {
int number = 0;
if(data!=null&&data.length>0) {
int first = getFirstK(data,data.length,k,0,data.length-1);
int last = getLastK(data,data.length,k,0,data.length-1);
if(first>-1&&last>-1) number = last - first+1;
}
return number;
}
//找到该数字出现的第一个位置
public static int getFirstK(int[] data,int length,int k,int start,int end) {
if(start>end) return -1;
int mid = (start+end)>>1;
int midData = data[mid];
if(midData == k) {
if((mid>0&&data[mid-1]!=k)||mid == 0) {
return mid;
}else end = mid-1;
}else if(midData>k) {
end = mid -1;
}else {
start = mid+1;
}
return getFirstK(data,length,k,start,end);
}
//找到该数字出现的最后一个位置
public static int getLastK(int [] data,int length,int k,int start,int end) {
if(start>end) return -1;
int mid = (start+end)>>1;
int midData = data[mid];
if(midData == k) {
if((mid<length-1&&data[mid+1]!=k)||mid == length-1) {
return mid;
}else start = mid+1;
}else if(midData<k) {
start = mid+1;
}else {
end = mid-1;
}
return getLastK(data,length,k,start,end);
}
}
输出 2