single-number-ii

Given an array of integers, every element appears three times except for one. Find that single one.

Note: 
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

//这道题最牛的是用位运算来计算，数学其实就是化繁为简，这是真的难，简单但是晦涩。

学到了

import java.util.HashMap;
import java.util.Set;
public class Solution {
    public int singleNumber(int[] A) {
        HashMap<Integer, Integer> map =new HashMap<Integer, Integer>();
	     for (int i = 0; i < A.length; i++) {
			if(map.containsKey(A[i])) {
				int t = (int) map.get(A[i])+1;
				map.remove(A[i]);
				map.put(A[i], t);
			}else {
				map.put(A[i], 1);
			}
		}
	    
	     Set<Integer> keySet = map.keySet();
	     for (Integer integer : keySet) {
			if(map.get(integer)==1)return integer;
		}
	     return 0;
    }
}

//位运算

public int singleNumber(int[] A) {
        int ones = 0;//记录只出现过1次的bits
        int twos = 0;//记录只出现过2次的bits
        int threes;
        for(int i = 0; i < A.length; i++){
            int t = A[i];
            twos |= ones&t;//要在更新ones前面更新twos
            ones ^= t;
            threes = ones&twos;//ones和twos中都为1即出现了3次
            ones &= ~threes;//抹去出现了3次的bits
            twos &= ~threes;
        }
        return ones; 
    }