```import java.util.HashSet;
public class Solution{
     public int duplicate (int[] numbers) {
        // write code here
        int length = numbers.length;
        if (length<=0){
            return -1;
        }

       HashSet<Integer> numberset = new HashSet<>();
        int result = 0;
        for (int num:numbers) {
            if (numberset.contains(num)){
                result = num;
                break;
            }else {
                numberset.add(num);
            }
        }

        return result;
    }
    }
解题思路:
	利用set集合只能存储唯一值;取出数组中的元素存于set,若set中包含即为重复数字。