[LeetCode] 136. Single Number

题目链接：传送门

Description

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

题意：

给定一组数，其中有一个数只出现一次，其余数出现两次，找到这个只出现一次的数

思路：

很经典&&印象深刻的一道题，利用异或运算的特性解题即可

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