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 num[], int length, int* duplication) {
if (!num || length < 1) return false;
for (int i = 0; i < length; i++){
if (num[i] < 0 || num[i] > length-1) return false;
if (num[i] == num[num[i]]){
if (num[i] != i){
*duplication = num[i];
return true;
}
}
swap(num[i], num[num[i]]);
}
return false;
}
};