260. Single Number III

解法一：

public class Solution {
    public int[] singleNumber(int[] nums) {
        int[] copyNum = new int[nums.length];
		LinkedList<Integer> list = new LinkedList<Integer>();
		
		for (int i : nums) {
			if (list.contains(i)) {
				list.remove(list.indexOf(i));
			}
			else {
				list.add(i);
			}
		}
		int res[] = new int[2];
		res[0] = list.pop();
		res[1] = list.pop();
		return res;
    }
}

解法二：