LeetCode - Single Number
2014-09-17 15:36
411 查看
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?
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 num=0;
if(n<=0){
return num;
}
num=A[0];
for(int i=1;i<n;i++){
num^=A[i];
}
return num;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode *** 136. Single Number
- leetcode -- Single Number -- 重点--位运算
- leetcode 136. Single Number | XOR的巧妙运用
- Java for LeetCode 136 Single Number
- [Leetcode]Single Number
- leetcode_136 Single Number
- leetcode[136]:Single Number
- LeetCode:Single Number
- leetcode 136 Single Number, 260 Single Number III
- Leetcode[136]-Single Number
- LeetCode--Single Number
- [leetcode] 【数组】 136. Single Number
- LeetCode 136 Single Number
- LeetCode——136. Single Number
- 【LEETCODE】136-Single Number
- Leetcode No. 136. Single Number
- [LeetCode] Single Number, Solution
- [LeetCode]Single Number
- leetcode —— single number
- [LeetCode] Single Number