Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?
Example 1:
Input: [2,2,3,2]
Output: 3
Example 2:
Input: [0,1,0,1,0,1,99]
Output: 99
LeetCode:链接
本题做法非常巧妙,只需要巧妙的遍历一遍数组,时间复杂度是O(n),而且也没有占用额外的空间。
与的优先级高于异或。
class Solution:
def singleNumber(self, nums: List[int]) -> int:
ones, twos = 0, 0
for num in nums:
ones = num & (~twos) ^ ones
twos = num & (~ones) ^ twos
return ones
当num第一次出现的时候,因为ones和twos都初始化为0,所以很显然运行这两行代码之后ones=num,twos=0。
在此之后,如果num不再出现,那么很显然这就是只储存一次的数字,ones即为最终结果。
如果num第二次出现,那么ones会被清零,twos会储存num的值。
当其第三次出现的时候,ones和twos都会被清零。