剑指offer-数组中重复的数字

问题描述：

源码：

改变原数组，时间复杂度O(n)，空间复杂度O(1)

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