Single Number II

最新推荐文章于 2022-07-02 13:41:47 发布

撄宁之境

最新推荐文章于 2022-07-02 13:41:47 发布

阅读量447

点赞数

分类专栏： LeetCode 文章标签： LeetCode 算法

本文链接：https://blog.csdn.net/huangynn/article/details/38302593

版权

LeetCode 专栏收录该内容

67 篇文章 0 订阅

订阅专栏

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

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

class Solution {
public:
    int singleNumber(int A[], int n) {
        int bitcount=sizeof(int) * 8; 
        int record[bitcount];
        memset(record,0,bitcount*sizeof(int));
        int mask;
        for(int i=0;i<n;++i)
           for(int j=0;j<bitcount;++j)
           {
                record[j]+=A[i]>>j&1;
           }
        int result=0;
        for(int i=0;i<bitcount;++i)
            result|=(record[i]%3)<<i;
        return result;
    }
};

模拟三进制