题目:统计一个数字在排序数组中出现的次数。例如输入排序数组{1,2,3,3,3,3,4,5}和数字3,由于3在这个数组中出现了4次,因此输出4。
Java代码实现:
public class GetNumberOfK {
public int getFirstK(int [] data, int length, int k, int start, int end)
{
if(start > end)
return -1;
int middleIndex = (start + end) / 2;
int middleData = data[middleIndex];
if(middleData == k)
{
if((middleIndex > 0 && data[middleIndex - 1] != k) || middleIndex == 0)
return middleIndex;
else
end = middleIndex - 1;
}
else if(middleData > k)
{
end = middleIndex - 1;
}
else
{
start = middleIndex + 1;
}
return getFirstK(data, length, k, start, end);
}
public int getLastK(int [] data, int length, int k, int start, int end)
{
if(start > end)
return -1;
int middleIndex = (start + end) / 2;
int middleData = data[middleIndex];
if(middleData == k)
{
if((middleIndex < length - 1 && data[middleIndex + 1] != k) || middleIndex == length - 1)
return middleIndex;
else
start = middleIndex - 1;
}
else if(middleData < k)
{
start = middleIndex + 1;
}
else
{
end = middleIndex - 1;
}
return getLastK(data, length, k, start, end);
}
public int getNumberOfK(int [] data, int length, int k)
{
int number = 0;
if(data != null && length > 0)
{
int first = getFirstK(data, length, k, 0, length - 1);
int last = getLastK(data, length, k, 0, length - 1);
if(first > -1 && last > -1)
number = last - first + 1;
}
return number;
}
public static void main(String[] args) {
int [] data = new int[]{1,2,3,3,3,3,4,5};
System.out.println(new GetNumberOfK().getNumberOfK(data, 8, 3));
}
}
运行结果截图:
总结:getFirstK()和getLastK()都是利用二分查找法在数组中查找指定数字K第一次和最后一次出现的位置,他们的时间复杂度都是O(logn),因此getNumberOfK()的总的时间复杂度也只有O(logn)。