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