WebClub codebuddy week3

SingleNumberII.cpp

int Solution::singleNumber(const vector<int> &A) {
    vector<int> n(32,0);
    int t = 1;
    for(int i = 1; i < 32 ; i++){
        int one = 0;
        if( i==1 ){
            t = 1;
        }
        else{
            t = t<<1;
        }
        for(int j = 0 ; j < A.size() ; j++){
            int x = t&A[j];
            if(x!=0)
            one = one + 1;
        }
        n[i-1]=one%3;
    }
    int num=0,b=1;
    for(int i=0;i<31;i++){
        num = num + (n[i]*b);
        b = b * 2;
    }
    return num;
}