136. Single Number

weixin_30763397

于 2017-07-24 17:36:00 发布

阅读量54

点赞数

CC 4.0 BY-SA版权

文章标签： runtime

原文链接：http://www.cnblogs.com/pk28/p/7230136.html

本文提供了一种使用异或运算解决寻找数组中唯一不重复元素的方法。该算法具备线性时间复杂度且无需额外内存开销，适用于高效处理大规模数据集。

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?

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        int ans = 0;
        vector<int>::const_iterator it = nums.cbegin();
        for (; it != nums.cend(); ++it) {
            ans^=*it;
        }
        return ans;
    }
};

转载于:https://www.cnblogs.com/pk28/p/7230136.html