Leetcode 137 Single Number II

Problem Definition

Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.

Note:

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

Example 1:

Input: [2,2,3,2]
Output: 3
Example 2:

Input: [0,1,0,1,0,1,99]
Output: 99

Soluitons:

1. Bit manipulation

What we need is that we shoud find out a kind of calculation rules to satisfy:
1 @@ 1 @@ 1 = 0
First, we assume that every integer is represented by three binary bits, and every integer in the problem is non-negative number.
The basic idea is to accumulate the ith digit of each number. And mod three. You should visit all the 32 bits of the integer. Because in Java, the integer is represented by 32 bits. First we visit the 0-th digit of every integer. And calculate them all, and then mod three. The second step is to visit the first digit of the integers and do the same thing as before until we have visited all the 32 bits of the number.
The time complexity is n square.

class Solution {
 public int singleNumber(int[] nums) {
     if(nums.length == 0)    return 0;
     int res = 0;
     for(int i = 0; i < 32; i++){
         int sum = 0;
         for(int num : nums){
             sum += (num >> i) & 1;
         }
         res = ((sum % 3) << i) | res;
     }
     return res;
 }
}