LeetCode：Single Number
2017-02-23 11:39
357 查看
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?
Subscribe to see which companies asked this question.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
Subscribe to see which companies asked this question.
class Solution {
public:
int singleNumber(vector<int>& nums) {
int result = 0;
for(int i=0;i<nums.size();++i)
{
result = result^nums[i];
}
return result;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode——136. Single Number
- LeetCode 136 — Single Number（C++ Java Python）
- LeetCode---Single Number
- leetcode || 136、Single Number
- 【leetcode】136. Single Number【java】使用异或
- LeetCode——Single Number
- LeetCode 找出 单独的数 Single Number
- 【leetcode】Single Number 1 & 2
- LeetCode-Easy刷题(31) Single Number
- LeetCode - Refresh - Single Number
- leetcode - Single Number
- LeetCode 136 Single Number
- LeetCode -- Single Number
- [Leetcode]136. Single Number
- [Leetcode] Single Number
- LeetCode Single Number
- leetcode-Single Number
- [leetcode]136 Single Number
- leetcode 之Single Number
- leetcode 136. Single Number | XOR的巧妙运用