260. Single Number III

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?
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

解题思路： 就是将数据的分布放在map中。然后遍历一次找出所有的只有1的数据点。

public class Solution {
    public int[] singleNumber(int[] nums) {
        int len = nums.length; 
        if(nums == null || len == 0)
        {
            return null;
        }
        List<Integer> list = new ArrayList<Integer>();
        Map<Integer,Integer> map = new HashMap<Integer, Integer>();
        for(int i = 0; i < len; i++)
        {
            if(map.containsKey(nums[i]))
            {
                int value = map.get(nums[i]);
                value++;
                map.put(nums[i], value);
            }else{
                map.put(nums[i], 1);
            }
        }
        Iterator iter = map.entrySet().iterator();
        while(iter.hasNext())
        {
            Map.Entry entry = (Map.Entry) iter.next();
            if((int)entry.getValue() == 1)
            {
                list.add((int)entry.getKey());
            }
        }
        int[] res = new int[list.size()];
        for(int i = 0; i < list.size(); i++)
        {
            res[i] = list.get(i);
        }

        return res;        
    }
}