LeetCode | 137. Single Number II

 

题目：

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

 

代码：

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        if(nums.size() == 1)
			return nums[0];
		int target = 0;
		for(int i = 0; i<32; i++){
			int count1 = 0;
			for(int j = 0; j<nums.size(); j++){
				int tmp = ( (unsigned int) nums[j] << i ) >> 31;
				count1 += tmp;
			}
			target |= (count1 % 3) << (31 - i);
		}
		return target;
    }
};

 

一次AC~