leetcode第六周解题报告

136. Single Number

题目描述：

Given an array of integers, every element appears twice except for one. Find that single one.

解题思路：按位异或运算

代码如下：

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

结果如下：