50、数组中重复的数字

定义一个map，遍历数组，遍历到的数字未出现在map中则put一下，出现了就返回这个数字即可

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> map=new HashMap<>();
        for(int i=0;i<length;i++){
            if(!map.containsKey(numbers[i])){
                map.put(numbers[i],1);
            }
            else{
                duplication[0]=numbers[i];
                return true;
            }
        }
        return false;
    }
}