LeetCode:Single Number
2014-09-11 15:13
274 查看
Single Number
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?
已AC 36ms
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?
<span style="font-size:18px;">int singleNumber(int A[], int n)
{
int result = 0;
for(int i = 0;i<n;i++)
result ^= A[i];
return result;
}</span>偶数个相同的整数异或后为0，所以遍历数组，与所有的数组元素相继异或，最后异或的结果就是单独 的整数已AC 36ms
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode 之 Single Number
- LeetCode 136 Single Number
- LeetCode - 136. Single Number
- LeetCode_136-Single Number
- 《leetCode》：Single Number
- leetcode-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
- 【leetcode77】Single Number
- Leetcode NO.136 Single Number
- [leetcode]Single Number
- Leetcode-136 Single Number
- [LeetCode] Single Number, Solution
- leetcode 虐我篇之（七）Single Number
- 【LeetCode】136. Single Number