leetcode || Single Number

原创于 2014-06-25 21:48:14 发布 · 539 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

12 篇文章

订阅专栏

本文介绍了一种算法，用于在给定整数数组中找到仅出现一次的唯一元素，该算法具有线性时间复杂度且不使用额外内存。

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?

ANS:

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