LeetCode137——Single Number II
2015-02-26 18:15
267 查看
Given an array of integers, every element appears three times except for one. Find that single one.
Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
难度系数:
中等
实现
这题要线性时间,不使用额外存储,我觉得挺难的,我没做出来,看来网上的答案。方法很好,理解后也不是很难,只是之前没 做过类似的,估计不容易想出来。[code]int singleNumber(int A[], int n) { int one = 0, two = 0, three = 0; for (int i = 0; i < n; ++i) { three = two & A[i]; two |= one & A[i]; one |= A[i]; one ^= three; two ^= three; } return one; }
相关文章推荐
- Leetcode 137 Single Number II 仅出现一次的数字
- LeetCode 137:Single Number II
- [leetcode 137] Single Number II
- LeetCode 137 Single Number II
- LeetCode 137 Single Number II
- leetcode[137] Single Number II
- LeetCode 137 Single Number II
- LeetCode---(137)Single Number II
- 【LeetCode】136 & 137 & 260 - Single Number I & II &III
- leetcode137 Single Number II
- leetcode 137 Single Number II
- Leetcode 137: (Single Number II)
- leetcode[137]:Single Number II
- leetcode137~Single Number II
- [LeetCode] 137--Single Number II --Medium--
- leetcode[137]Single Number II
- Java [Leetcode 137]Single Number II
- The Solution to Leetcode 137 Single Number II
- LeetCode 137 Single Number II
- [Leetcode 137, Medium] Single Number II