LeetCode：Single Number
2014-11-29 13:26
239 查看
Given an 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?
class Solution {
public:
int singleNumber(int A[], int n) {
int i;
for (i = 1; i < n; i++) {
A[0] ^= A[i];
}
return A[0];
}
};
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
class Solution {
public:
int singleNumber(int A[], int n) {
int i;
for (i = 1; i < n; i++) {
A[0] ^= A[i];
}
return A[0];
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode] Single Number
- LeetCode --Single Number
- Java [Leetcode 136]Single Number
- LeetCode 136 Single Number 出现一次的数字
- LeetCode136—Single Number
- LeetCode题解：Single Number
- 【leetcode】136. Single Number
- LeetCode: Single Number
- LeetCode 之 Single Number
- leetcode-Single Number
- [LeetCode] Single Number
- leetcode-136-Single Number
- [LeetCode]Single Number
- LeetCode | Single Number
- leetcode 136. Single Number
- LeetCode刷题笔录 Single Number
- 10--LeetCode【Single Number】|C语言|
- Leetcode：136. Single Number
- leetcode之Single Number
- [leetcode-136]Single Number(c)