Leetcode 137：Single Number II

最新推荐文章于 2023-12-16 00:08:35 发布

被打的小怪兽

最新推荐文章于 2023-12-16 00:08:35 发布

阅读量83

点赞数

分类专栏：算法题

本文链接：https://blog.csdn.net/qq_34314736/article/details/100558847

版权

算法题专栏收录该内容

118 篇文章 0 订阅

订阅专栏

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

C++
int singleNumber(vector<int>& nums) {
        int res = 0;
        int sum = 0;
        for(int i = 0;i < 32;++i)
        {
            sum = 0;
            for(int j = 0;j < nums.size();++j)
            {
                sum += (nums[j] >> i) & 1;
            }
            res += (sum % 3)<<i;
        }
        return res;
    }