LeetCode:Single Number
2014-03-26 09:06
447 查看
这题想不到很难，想到了就很简单。利用以前C++学过的异或运算，因为太少用了吧，所以想了半天都没想到，代码很简单。
class Solution {
public:
int singleNumber(int A[], int n) {
int x=0;
for(int i=0;i<n;i++){
x=x^A[i];
}
return x;
}
};
class Solution {
public:
int singleNumber(int A[], int n) {
int x=0;
for(int i=0;i<n;i++){
x=x^A[i];
}
return x;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode] Single Number
- LeetCode - 136. Single Number - ( C++ ) - 解题报告 - 位运算思路 xor
- LeetCode----Single Number
- leetcode 136. Single Number
- <LeetCode>136. Single Number
- [leetcode][bit] Single Number
- [leetcode]136 Single Number
- leetcode 之Single Number
- Leetcode-136. Single Number
- The Solution to Leetcode 136 Single Number
- [leetcode] Single Number
- Leetcode-136. Single Number
- 【LeetCode】Single Number
- [LeetCode] 136. Single Number
- LeetCode-136.Single Number
- LeetCode——Single Number（找出数组中只出现一次的数）
- LeetCode 136 Single Number题解
- [LeetCode] [Single Number 2013-10-01]
- Leetcode Single Number
- LeetCode 136. Single Number