【LeetCode】Single Number
2014-09-30 12:32
323 查看
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?
因为题目要求linear runtime complexity跟不允许有extra
memory，考虑用亦或操作来实现。
0^a = a;
a^a = 0;
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
因为题目要求linear runtime complexity跟不允许有extra
memory，考虑用亦或操作来实现。
0^a = a;
a^a = 0;
public class Solution {
public int singleNumber(int[] A) {
int result = 0;
for(int i = 0; i < A.length;i++)
{
result = result ^ A[i];
}
return result;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [LeetCode]--136. Single Number
- [Leetcode]Single Number
- LeetCode 136. Single Number
- [leetcode] Single Number系列
- [LeetCode By Python]136. Single Number
- LeetCode:Single Number
- [LeetCode][Java] Single Number
- LeetCode 136. Single Number
- leetcode_c++：哈希：Single Number（136）
- leetcode--Single Number
- 4000 leetcode 136.Single Number
- [LeetCode] Single Number, Solution
- [LeetCode]Single Number
- leetcode —— single number
- Single Number -- leetcode
- LeetCode 136. Single Number
- 【LeetCode】136.Single Number_EASY(十)
- [LeetCode] Single Number
- LeetCode 之 Single Number
- Single Number 【leetcode】1分钟解题系类