[LeetCode]Single Number
2014-05-13 18:20
141 查看
Given an array of integers, every element appears twice except
for one. Find that single one.
因为只有一个数是一个，其余都为2个，故采用一直异或下去就可以求得结果
for one. Find that single one.
因为只有一个数是一个，其余都为2个，故采用一直异或下去就可以求得结果
class Solution {
public:
int singleNumber(int A[], int n) {
for(int i = 0; i < n; i++)
{
if(n == 1)
{
return A[0];
}
if(i == 0)
{
i++;
}
A[0] ^= A[i];
}
return A[0];
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode:Single Number
- leetcode136 Single Number
- [LeetCode] Single Number 单独的数字
- leetcode之Single Number
- LeetCode（136） Single Number
- Leetcode 136. Single Number
- LeetCode--Single Number
- leetcode刷题17：single number 2
- leetcode 136. Single Number
- LeetCode:Single Number
- 【LeetCode】136 Single Number
- [LeetCode]136. Single Number
- [Leetcode从零开刷]136. Single Number
- [leetcode]Single Number
- [LeetCode]Single Number
- LeetCode-Hash-136. Single Number
- LeetCode Single Number
- [C++]LeetCode: 66 Single Number
- leetcode 136-Single Number
- [LeetCode] Single Number