数组中重复的数字

最开始的做法： 空间复杂度O(n)

import java.util.*;
public class Solution {
    // Parameters:
    //    numbers:     an array of integers
    //    length:      the length of array numbers
    //    duplication: (Output) the duplicated number in the array number,length of duplication array is 1,so using duplication[0] = ? in implementation;
    //                  Here duplication like pointor in C/C++, duplication[0] equal *duplication in C/C++
    //    这里要特别注意~返回任意重复的一个，赋值duplication[0]
    // Return value:       true if the input is valid, and there are some duplications in the array number
    //                     otherwise false
    public boolean duplicate(int numbers[],int length,int [] duplication) {
        HashMap<Integer,Integer>hashmap=new HashMap<>();
        for(int i=0;i<length;i++)
        {
            if(!hashmap.containsKey(numbers[i]))
            {
                hashmap.put(numbers[i],1);
            }
            else
            {
                duplication[0]=numbers[i];
                return true;
            }
        }
        return false;
    }
}

书上的做法： 空间复杂度O(n)

import java.util.*;
public class Solution {
    // Parameters:
    //    numbers:     an array of integers
    //    length:      the length of array numbers
    //    duplication: (Output) the duplicated number in the array number,length of duplication array is 1,so using duplication[0] = ? in implementation;
    //                  Here duplication like pointor in C/C++, duplication[0] equal *duplication in C/C++
    //    这里要特别注意~返回任意重复的一个，赋值duplication[0]
    // Return value:       true if the input is valid, and there are some duplications in the array number
    //                     otherwise false
    public boolean duplicate(int numbers[],int length,int [] duplication) {
        int index=0;
        while(index<length)
        {
            if(index==numbers[index]) index++;
            else
            {
                if(numbers[numbers[index]]==numbers[index])
                {
                    duplication[0]=numbers[index];
                    return true;
                }
                else
                {
                    int temp=numbers[index];
                    numbers[index]=numbers[numbers[index]];
                    numbers[temp]=temp; //注意
                }
            }
        }
        return false;
    }
}

最开始写出来陷入了死循环，不知道为什么。后来发现是最后一步swap的时候，无脑写了numbers[number[index]]=temp。但其实这时候numbers[index]已经不是temp的值了，需要注意一下。