leetcode 刷题 136 137

from functools import reduce
class Solution: def singleNumber(self, nums: List[int]) -> int: return sum(list(set(nums)))*2 - sum(nums) # return reduce(lambda x, y: x ^ y, nums or [-1])

  

 

  
1
  
2
  
3
  
4
  
5
 

class Solution: def singleNumber(self, nums: List[int]) -> int: # return sum(1<<i if i<31 else -2**31 for i in range(32) if sum((n>>i)&1 for n in nums) % 3) # return sum([-2**63,1<<i][i<63] for i in range(64) if sum((n>>i)&1 for n in nums)%3) # return (sum(set(nums)) * 3 - sum(nums)) // 2 a = b = 0 for n in nums: b = (b^n)&~a a = (a^n)&~b return b

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
 

文章来源: maoli.blog.csdn.net，作者：刘润森！，版权归原作者所有，如需转载，请联系作者。

原文链接：maoli.blog.csdn.net/article/details/90745087