【59】136. Single Number

136. Single Number

Description Submission Solutions Add to List

• Total Accepted: 191020
• Total Submissions: 360448
• Difficulty: Easy
• Contributors: Admin

 

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?

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