[leetcode] Single Number

原创于 2015-06-08 10:01:40 发布 · 270 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

本文介绍了一种在整数数组中找到唯一不重复元素的方法。该算法具备线性时间复杂度，并且不需要额外的内存开销。通过使用异或运算实现了高效查找。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

From : https://leetcode.com/problems/single-number/

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) {
        if(nums.size() == 0) return 0;
        int result = nums[0], len=nums.size();
        for(int i=1; i<len; i++) result ^= nums[i];
        return result;
    }
};