剑指offer 数组中重复的数字

思路很棒，每一个数字去找它应在的位置。

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 == NULL || length == 0 || duplication == NULL)
            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[temp];
                    numbers[temp] = temp;
                }
            } 
        }     
        return false;
    }
};