Single Number II

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

Siren0413

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

阅读量508

点赞数

分类专栏： Leetcode 文章标签： algorithm leetcode

本文链接：https://blog.csdn.net/siren0413/article/details/18828265

版权

Leetcode 专栏收录该内容

62 篇文章 0 订阅

订阅专栏

Single Number II

Total Accepted: 7073 Total Submissions: 22573 My Submissions

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?

取得每一位的加总和，然后 mod 3, 如果==0，那么该位一定为0(表示那个数在该位为0)，否则该位为1 (那个数如果出现两次，那么取模后是2，如果出现一次，取模后是1)

public static int singleNumber(int[] A) {
    int bit = 0;
    for (int i = 0; i < 32; i++) {
        int sum = 0;
        for (int j = 0; j < A.length; j++) {
            sum += (A[j] & (1 << i)) >> i;
        }
        bit |= (sum % 3 == 0 ? 0 : 1) << i;  // in this case, the one can appear either once or twice.
    }
    return bit;
}