leetcode 136 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?

Subscribe to see which companies asked this question

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        int answer=nums[0];
        for(unsigned long i=1;i!=nums.size();++i)
            answer=answer^nums[i];
        return answer;
    }
};