时间复杂度(O( n))
class Solution {
public:
int singleNumber(vector<int>& nums) {
if(nums.size()==0) return 0;
int result = 0;
for(int i=0;i < nums.size();i++)
result = result^nums[i];
return result;
}
};