single-number

最新推荐文章于 2019-06-07 00:40:42 发布

a819721810

最新推荐文章于 2019-06-07 00:40:42 发布

阅读量470

点赞数

分类专栏：随笔 leetcode

本文链接：https://blog.csdn.net/a819721810/article/details/45697101

版权

随笔同时被 2 个专栏收录

19 篇文章 0 订阅

订阅专栏

leetcode

4 篇文章 0 订阅

订阅专栏

Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
因为A XOR A = 0，且XOR运算是可交换的，于是，对于实例{2,1,4,5,2,4,1}就会有这样的结果：

(2^1^4^5^2^4^1) => ((2^2)^(1^1)^(4^4)^(5)) => (0^0^0^5) => 5
就把只出现了一次的元素(其余元素均出现两次)给找出来了！

class Solution {
public:
    int singleNumber(int A[], int n) {
        int ans = A[0];
        for (int i = 1; i < n; i++)
        {
            ans = ans ^ A[i];
        }
        return ans;

    }
};