LeetCode - 136. Single Number
2017-03-02 19:53
423 查看
题目:
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?
思路与步骤:
极低效率思路:
用 HashMap先排序
高效思路:
学习别人的思路用XOR,注意数组中用到抑或时常常会所有的数字一起抑或,因为在数组中单独两个数字抑或意义不大。
编程实现:
这里只给出用抑或实现的程序public class Solution {
public int singleNumber(int[] nums) {
int result = 0;
for (int n: nums) result ^= n;
return result;
}
}
相关文章推荐
- leetcode-136-Single Number
- leetcode -- 136. Single Number【组对】
- LeetCode 136 single number
- LeetCode 136 : Single Number
- Leetcode: Single Number(136,137). 位运算解法分析
- Leetcode 136. Single Number
- leetcode 136. Single Number
- 【LeetCode】136. Single Number
- LeetCode 136 Single Number
- LeetCode: 136. Single Number
- 4000 leetcode 136.Single Number
- LeetCode之136. Single Number
- LeetCode 136. Single Number
- LeetCode(136)Single Number
- leetcode136 Single Number136 Java
- Java for LeetCode 136 Single Number
- Leetcode[136]-Single Number
- leetcode_136 Single Number-找数组中唯一的单身数
- leetcode:136. Single Number解题报告
- LeetCode 136. Single Number