leetcode:Single Number II

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

yxsh01

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

阅读量386

点赞数

分类专栏：算法题文章标签： leetcode

本文链接：https://blog.csdn.net/yxsh01/article/details/41287839

版权

算法题专栏收录该内容

22 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int singleNumber(int A[], int n) {
        int sign = 0;
        long long ret = 0;
        for(int i = 0; i < n ;i++)
        {
            long long c = A[i];
            if(A[i] < 0)
            {
                sign++;
                ret = threeXOR(ret,-c);
            }
            else
                ret = threeXOR(ret,c);
        }
        sign %= 3;
        if(sign != 0)
            ret = -ret;
        return ret;
    }
    
    
    
    long long threeXOR(long long a, long long b)
    {
        long long result = 0;
        long long pos = 1;
        while(a > 0 || b > 0)
        {
            int r = 0;
            r += (a%3);
            r += (b%3);
            a/=3;
            b/=3;
            r %= 3;
            result += r*pos;
            pos*=3;
        }
        return result;
        
    }
};