题目见书《剑指offer第二版》41页,纯属自己笔记,以待日后回看。
该题编程思想:基于二分查找的思想,统计不同范围内数组数字的数目是否超出范围。完整代码见下:
#include <iostream>
//#include<string.h>
using namespace std;
int countRange(const int* numbers, int length, int start, int end);
int getDuplication(const int* numbers, int length)
{
if (numbers == nullptr || length <= 0)
return -1;
int start = 1;
int end = length - 1;
while (end >= start)
{
int mid = ((end - start) >> 1) + start;
int count = countRange(numbers, length, start, mid);
//当只有一个数的时候,考虑重复
if (start == end)
{
if (count > 1)
return start;
else
break;
}
//二分查找
if (count > mid - start + 1)
end = mid; //前一段有重复的数字
else
start = mid + 1; //后一段有重复的数字
}
return -1;
}
int countRange(const int* numbers, int length, int start, int end)
{
if (numbers == nullptr)
return 0;
int count = 0;
for (int i = 0; i < length; i++)
if (numbers[i] >= start && numbers[i] <= end)
++count;
return count;
}
int main()
{
int a[] = { 2,3,5,4,3,2,6,7 };
int l = 8;
int number = getDuplication(a, l);
cout << "重复的数字\n" << number << endl;
system("pause");
return 0;
}
结果如: