T38 数字在排序数组中出现的次数
解法一 书中解法
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;
}
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);
}
// 找到数组中最后一个k的下标。如果数组中不存在k,返回-1
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);
}
解法二: 非递归,循环的方式重写解法一求GetFirstIndex
int GetFirstOfK(int *data, int value, int len)
{
int l = 0, r = len - 1;
while (l <= r)
{
int mid = (l + r) / 2;
int midvalue = data[mid];
if (midvalue == value)
{
if (mid==0||(mid>0&&data[mid - 1] < midvalue))
return mid;
else
r = mid-1;
}
else if (midvalue < value)
l = mid+1;
else if (midvalue>value)
r = mid-1;
}
}