[刷题]Single Number III

[LintCode]Single Number III

public class Solution {
	/**
	 * @param A : An integer array
	 * @return : An integer 
	 */
    public int singleNumberII(int[] A) {
        // 2015-09-17 O(n)
        if (A == null || A.length == 0) {
            return 0;
        }
        HashMap<Integer, Integer> map = new HashMap<>();
        for (int i = 0; i < A.length; i++) {
            if (!map.containsKey(A[i])) {
                map.put(A[i], 1);
            } else if (map.get(A[i]) == 2) {
                map.remove(A[i]);
            } else {
                map.put(A[i], map.get(A[i]) + 1);
            }
        }
        Set<Integer> keyset = map.keySet();
        for (Integer rst : keyset) {
            return rst;
        }
        return 0;
    }
}