[Leetcode] Single number II

Single number II

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

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

Using hash table is possible, but extra space is used.

If you want to use no extra space, you can use bit arithmetic.

All and occurrences of the topic can be used in bitwise arithmetic, Majority element can also.

1 classSolution {2  Public:3     intSinglenumber (vector<int>&nums) {4         intresult=0;5vector<int> Bit ( +,0);6          for(intI=0; I<nums.size (); i++)7         {8             inttemp =Nums[i];9              for(intj =0;j< +; j + +)Ten             { Onebit[j]+= (TEMP&GT;&GT;J) &0x01); Abit[j]%=3; -             } -         } the          for(intj=0;j< +; j + +) -         { -result+=bit[j]<<J; -         } +         returnresult; -     } +};

[Leetcode] Single number II