260. Single Number III

Description: Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.

For example:

Given nums = [1, 2, 1, 3, 2, 5], return [3, 5].

Note:
The order of the result is not important. So in the above example, [5, 3] is also correct.
Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?

解题思路

这道题我用的是Set，如果已经存在一个数还要add的话，就把要add的从Set中remove，最后必定只剩下两个数。

Java-Solution

public class Solution {
    public int[] singleNumber(int[] nums) {
        Set<Integer> distinct = new HashSet<Integer>();
        for(int i = 0; i < nums.length; i++){
            if(!distinct.contains(nums[i])){
                distinct.add(nums[i]);
            }
            else{
                distinct.remove(nums[i]);
            }
        }
        Iterator<Integer> it = distinct.iterator();
        int[] result = new int[2];
        int count = 0;
        while (it.hasNext() && count < 2){  
            result[count] = it.next();
            count++;
        }  
        return result;
    }
}

来自博主的吐槽：最近写的代码运行时间感人啊= =，一次次刷新下限，看来要拾起数学了。