Posted on September 28, 2020September 28, 2020

Single Number

• Tag array, leetcode 136, single number, XOR
• 0 Comments

---

Given a non-empty array of integers, every element appears twice except for one. Find that single one.

int singleNumber(vector<int>& nums) {
        
        int result = 0;
        for(int i=0;i<nums.size();++i)
            result ^= nums[i];
        return result;
    }