[LeetCode] Single Number II
2015-03-06 17:02
274 查看
问题描述：
参考出现两次的，也是需要异或运算，问题是现在得判断出现三次归零的运算。需要两个辅助变量，参考了别人的代码。
Given an array of integers, every element appears three times except for one. Find that single one.
参考出现两次的，也是需要异或运算，问题是现在得判断出现三次归零的运算。需要两个辅助变量，参考了别人的代码。
class Solution: # @param A, a list of integer # @return an integer def singleNumber(self, A): ones,twos=0,0 for ele in A: ones = ones^ele & ~twos twos = twos^ele & ~ones return ones
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- [leetcode]Single Number II
- LeetCode: Single Number I && II
- 【leetcode】【137】Single Number II
- leetcode：Single Number II
- *LeetCode-Single Number II
- leetcode 刷题之路 84 Single Number II
- leetcode_137题——Single Number II（位运算）
- leetcode - Single Number II
- LeetCode——Single Number II
- leetcode-Single Number II
- [LeetCode] - Single Number II
- 【Leetcode】【Medium】Single Number II
- LeetCode------------single-number-ii
- leetcode || 137、Single Number II
- leetcode -- Single Number II
- [leetcode] Single Number II
- LeetCode | Single Number II
- LeetCode | Single Number II
- LeetCode: Single Number II
- LeetCode Single Number II