LeetCode Q136: 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?

Solution:

Use bit manipulation.

	class Solution {
	public:
	int singleNumber(vector<int>& nums) {
	int res=0;
	for(auto i: nums)
	res=res^i;
	return res;
	}
	};

view raw Q136SingleNumber.cpp hosted with ❤ by GitHub