Single Number -- leetcode
2013-10-27 13:19
393 查看
Given an array of integers , every element appears twice except for one. Find that single one.
hint : XOR
hint : XOR
class Solution{
public:
int singlenumber(int[] A,int n){
int res = 0;
for(int i = 0;i < n;i ++){
res ^= A[i];
}
return res;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode[136] Single Number 位运算异或，HashMap（Java）
- LeetCode 136. Single Number
- leetcode#136 Single Number
- [Leetcode]Single Number
- leetcode 136. Single Number 位操作
- leetcode-136-Single Number
- lintcode/leetcode由易至难第14题：Single Number
- Leetcode -- Single Number
- leetcode(十六)Single Number
- LeetCode 136. Single Number
- LeetCode 136 Single Number
- [LeetCode]Single Number
- leetcode：Single Number 【Java】
- [ LeetCode ] - 136. Single Number 解答
- 【leetcode】136. Single Number【java】使用异或
- leetcode136~Single Number
- LeetCode-Single Number
- [leetcode] Single Number
- 【Leetcode】Single Number
- leetcode--Single Number