class Solution {
public:
// Parameters:
// numbers: an array of integers
// length: the length of array numbers
// duplication: (Output) the duplicated number in the array number
// Return value: true if the input is valid, and there are some duplications in the array number
// otherwise false
bool duplicate(int numbers[], int length, int* duplication) {
int x;
if (numbers == nullptr || length <= 0)
return false;
for (int i = 0; i < length; ++i) {
if (numbers[i] > length - 1 || numbers[i] < 0)
return false;
}
sort(numbers, numbers + length);//升序排列
for (int j = 0; j < length; ++j) {
if (numbers[j] == numbers[j + 1]) {
*duplication = numbers[j];
return true;
}
}
return false;
}
};
class Solution {
public:
// Parameters:
// numbers: an array of integers
// length: the length of array numbers
// duplication: (Output) the duplicated number in the array number
// Return value: true if the input is valid, and there are some duplications in the array number
// otherwise false
bool duplicate(int numbers[], int length, int* duplication) {
int x;
if (numbers == nullptr || length <= 0)
return false;
for (int i = 0; i < length; ++i) {
if (numbers[i] > length - 1 || numbers[i] < 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;
}
else
{
int temp = numbers[i];
numbers[i] = numbers[numbers[i]];
numbers[temp] = temp;
}
}
}
return false;
}
};