LeetCode Single Number
2014-07-21 11:09
429 查看
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 i, result; result = 0; for (i=0;i<n;i++) result = result^A[i]; return result; } };
相关文章推荐
- [LeetCode] Single Number
- LeetCode 之 Single Number
- LeetCode 136 Single Number
- LeetCode --Single Number
- LeetCode - 136. Single Number
- LeetCode_136-Single Number
- LeetCode 解题报告 Single Number
- 《leetCode》:Single Number
- leetcode刷题第一波-Single Number
- LeetCode 之 Single Number
- Leetcode 136. Single Number
- [LeetCode] Single Number
- 算法分析与设计——LeetCode:136. Single Number
- 【leetcode77】Single Number
- [LeetCode]Single Number
- LeetCode:Single Number
- [LeetCode] Single Number 单独的数字
- Leetcode NO.136 Single Number
- [leetcode]Single Number
- Leetcode-136 Single Number