【Leetcode】【Medium】Single Number
2015-01-15 22:19
281 查看
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?
解题:
此题可直接运用异或运算的性质:N^A^A = N
代码:
但是在leetcode网站性能分析中,异或运算(19ms)不是最快的,不知道还有没有其他算法可以达到10ms以下。
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
解题:
此题可直接运用异或运算的性质:N^A^A = N
代码:
class Solution { public: int singleNumber(int A[], int n) { for (int i = 1; i < n; ++i) A[0] ^= A[i]; return A[0]; } };
但是在leetcode网站性能分析中,异或运算(19ms)不是最快的,不知道还有没有其他算法可以达到10ms以下。
相关文章推荐
- [LeetCode] 136--Single Number --Medium--
- 【leetcode】Single Number (Medium) ☆
- leetcode之single number
- Leetcode之Next Permutation (Medium)
- Leetcode 366. Find Leaves of Binary Tree (Medium) (cpp)
- [LeetCode]Single Number
- Leetcode刷题(Single Number)
- [leetcode]: 136. Single Number
- Leetcode 136 Single Number
- [LeetCode] Single Number
- Leetcode 357. Count Numbers with Unique Digits[medium]
- 【LeetCode】Jump Game II 跳跃游戏II - 贪心 Medium
- 【LeetCode】136. Single Number
- 211.leetcode Add and Search Word - Data structure design(medium)[Trie树]
- LeetCode | Single Number(数组中的单个数字)
- LeetCode_136. Single Number
- leetcode347:Top K Frequent Elements(medium)
- Leetcode 187. Repeated DNA Sequences (Medium) (cpp)
- [Leetcode 11, Medium] Container With Most Water
- Leetcode 347. Top K Frequent Elements (Medium) (cpp)