The Two Sneaky Numbers of Digitville

1class Solution {
2    public int[] getSneakyNumbers(int[] nums) {
3        HashSet<Integer> hashSet = new HashSet<Integer>();
4        int[] numbers = new int[2];
5        int numberIndex = 0;
6
7        for (int i = 0; numberIndex < 2 && i < nums.length; i++) {
8            int num = nums[i];
9
10            if (hashSet.contains(num)) {
11                numbers[numberIndex] = num;
12                numberIndex++;
13            }
14            else {
15                hashSet.add(num);
16            }
17        }
18
19        return numbers;
20    }
21}