LeetCode:Single NumberII

最新推荐文章于 2017-08-21 13:07:00 发布

vodkazc

最新推荐文章于 2017-08-21 13:07:00 发布

阅读量450

点赞数

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

本文链接：https://blog.csdn.net/feng1912/article/details/39226717

版权

leetcode 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

Single Number II

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?

   int singleNumber(int A[], int n) {
    int result = 0;
    int INT_SIZE = sizeof(int)*8;
    int* count = new int[INT_SIZE];
    memset(count,0,INT_SIZE*sizeof(int));
    for(int i = 0;i<n;i++)
    {
        for(int j = 0;j<INT_SIZE;j++)
            count[j] += (A[i]>>j)&1;
    }
    for(int i = 0; i<INT_SIZE;i++)
    {
        if(count[i] % 3 != 0)
            result |= 1<<i;
    }
    delete [] count;
    return result;
    }

统计整数每位1上的个数，若该位上1的个数不是3的倍数，则对应的single number 的位上为一

已AC