leetcode - Single Number
2013-10-14 10:37
351 查看
class Solution {
public:
int singleNumber(int A[], int n) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if (n<=0)
return 0;
int ans=0;
for (int i=0; i<n; i++)
ans ^= A[i];
return ans;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode | Single Number
- LeetCode之Single Number
- [LeetCode136]Single Number
- LeetCode 136 Single Number
- [LeetCode]Single Number
- 《leetCode》：Single Number
- [LeetCode]Single Number
- LeetCode Problem 136:Single Number
- LeetCode——136. Single Number
- LeetCode - Single Number (JAVA)
- Leetcode136: Single Number
- [LeetCode] Single Number
- 【LeetCode-260】Single Number(C++)
- [LeetCode] Single Number
- LeetCode | Single Number
- LeetCode: Single Number
- [leetcode]: 136. Single Number
- Leetcode刷题(Single Number)
- LeetCode - Single Number
- LeetCode_136. Single Number