LeetCode 136. Single Number C++
2020-12-13 15:00
标签：with appears hat linear solution 异或 out etc cto Given a non-empty 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? Example 1: Example 2: LeetCode 136. Single Number C++ 标签：with appears hat linear solution 异或 out etc cto 原文地址：https://www.cnblogs.com/dingxi/p/11571322.htmlInput: [2,2,1]
Output: 1
Input: [4,1,2,1,2]
Output: 4
巧用位操作
0 ^ n = n
n ^ n = 0
因为题目说明只有一个数出现一次，其余都出现两次，出现两次的数异或以后为0，0与出现一次的数n异或为nclass Solution {
public:
int singleNumber(vectorint>& nums) {
int s = 0;
for(int c : nums)
s ^= c;
return s;
}
};
下一篇：Python——数据类型
文章标题：LeetCode 136. Single Number C++
文章链接：http://soscw.com/essay/34698.html