剑指 Offer 03. 数组中重复的数字

package leetcode;

import java.util.HashSet;

public class offer_03 {
    
    public int findRepeatNumber(int[] nums) {
        HashSet<Integer> set=new HashSet<Integer>();
        int i;
        for(i=0;i<nums.length;i++) {
            if(!set.contains(nums[i])) {
                set.add(nums[i]);
            }
            else {
                break;
            }
        }
        System.out.println(nums[i]);
        return nums[i];
    }
    
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        offer_03 off=new offer_03();
        int[] nums= {3, 4, 2, 0, 0, 1};
        off.findRepeatNumber(nums);
    }

}