[LeetCode OJ] Single Number之二 ——Given an array of integers, every element appears THREE times except for one. Find that single one.

 1 class Solution {
 2 public:
 3     int singleNumber(int A[], int n) {
 4         int bits = sizeof(int)*8;
 5         int result=0;
 6         for(int i=1; i<=bits; i++)
 7         {
 8            int w=0;
 9            int t=1;
10            
11            for(int j=0; j<n; j++)
12                w += (A[j]>>(i-1))&t;
13            result+= (w%3)<<(i-1);  //若是除过一个数之外，其他数重复k次，则将此处的3改为k
14         }
15         return result;
16     }
17 };