[LeetCode] 102: Single Number

最新推荐文章于 2020-08-06 19:11:52 发布

1.02^365的成长裂变

最新推荐文章于 2020-08-06 19:11:52 发布

阅读量3.5k

点赞数

分类专栏： LeetCode2

本文链接：https://blog.csdn.net/raojunyang/article/details/77925261

版权

LeetCode2 专栏收录该内容

140 篇文章 0 订阅

订阅专栏

[Problem]

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?

[Solution]

class Solution {
public:
	int singleNumber(int A[], int n) {
		// Note: The Solution object is instantiated only once and is reused by each test case.
		
		// invalid
		if(n <= 0)return 0;
		
		// XOR
		int res = A[0];
		for(int i = 1; i < n; ++i) res = res^A[i];
		return res;
	}
};