leetcode:Bit Manipulation:Single Number II(137)

最新推荐文章于 2020-02-03 22:36:34 发布

LandscapeMi

最新推荐文章于 2020-02-03 22:36:34 发布

阅读量210

点赞数

分类专栏： leetcode(c++)

本文链接：https://blog.csdn.net/mijian1207mijian/article/details/52385552

版权

leetcode(c++) 专栏收录该内容

263 篇文章 0 订阅

订阅专栏

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

class Solution {  
public:  
    int singleNumber(vector<int>& nums) {  
        int length = nums.size();  
        int result = 0;  
        for(int i = 0; i<32; i++){  
            int count = 0;   
            int mask = 1<< i;  
            for(int j=0; j<length; j++){  
                if(nums[j] & mask)  
                    count++;  
            }  
          if(count %3)  
                result |= mask;  
        }  
        return result;  
    }  
};