2017/11/22 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 len = nums.size(); int a = nums[0]; for(int i = 1; i < len; i++){ a ^= nums[i]; // cout<<a<<endl; } return a; } };