在一个长度为n的数组里的所有数字都在0到n-1的范围内。 数组中某些数字是重复的,但不知道有几个数字是重复的。也不知道每个数字重复几次。请找出数组中任意一个重复的数字。 例如,如果输入长度为7的数组{2,3,1,0,2,5,3},那么对应的输出是第一个重复的数字2。
解法一:原地寻找法
class Solution {
public:
bool duplicate(int numbers[], int length, int* duplication)
{
if(numbers == NULL || length < 0) return false;
for(int i=0; i<length; ++i)
{
while(numbers[i] != i)
{
if(numbers[i] == numbers[numbers[i]])
{
*duplication = numbers[i];
return true;
}
int tmp = numbers[i];
numbers[i] = numbers[tmp];
numbers[tmp] = tmp;
}
}
return false;
}
解法二:位运算map
class Solution {
public:
bool duplicate(int numbers[], int length, int* duplication) {
if(numbers == NULL || length <= 0)
return false;
int n = (length+7)&~7;
char *repeat = new char[n]; //用于查重的数组
//初始化用于查重的数组
for (int i = 0; i < n; ++i) repeat[i] = 0;
bool flag = false; //初始化为没有找到
for(int i = 0; i < length; ++i){
//参数的合法性检查
if (numbers[i] < 0 || numbers[i] > length-1) return false;
if(repeat[numbers[i]/8] & 1<<numbers[i]%8){ //取余高于移位高于按位与
flag = true;
*duplication = numbers[i];
break;
}
repeat[numbers[i]/8] |= 1<<numbers[i]%8;
}
delete[] repeat; //格外注意!!!需要释放申请的内存空间
return flag;
}
};
解法三:哈希
class Solution{
public:
bool duplicate(int numbers[], int length, int* duplication)
{
if(numbers == NULL || length <= 0) return false;
int *buckets = (int *)malloc(sizeof(int)*length);
if(buckets == NULL) return false;
memset(buckets,0,sizeof(int)*length);
for(int i = 0; i < length; i++)
{
buckets[numbers[i]]++;
}
for(int pos = 0; pos < length; pos++)
{
if(buckets[pos] > 1)
{
*duplication = pos;
return true;
}
}
free(buckets);
buckets = NULL;
return false;
}
};