Single Number II

最新推荐文章于 2020-03-17 11:51:47 发布

Goofiness

最新推荐文章于 2020-03-17 11:51:47 发布

阅读量163

点赞数

分类专栏： leetcode 文章标签： leetcode python

本文链接：https://blog.csdn.net/byr_wy/article/details/83279037

版权

leetcode 专栏收录该内容

232 篇文章 0 订阅

订阅专栏

Single Number II

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

Input: [2,2,3,2]
Output: 3
Input: [0,1,0,1,0,1,99]
Output: 99

Solution

弱智解法：
class Solution(object):
    def singleNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        res = []
        if len(nums)==1:
            return nums[0]
        for i in range(len(nums)):
            judge = nums.pop()
            if(judge in nums or judge in res):
                res.append(judge)
                continue
            else:
                return judge

class Solution(object):
    def singleNumber(self, nums):
        one = 0
        two = 0
        three = 0
        for i in range(0,len(nums)):
            two |= one & nums[i] #当新来的为0时，two = two | 0，two不变，当新来的为1时，（当one此时为0，则two = two|0，two不变；当one此时为1时，则two = two | 1，two变为1
            one ^= nums[i]       #新来的为0，one不变，新来为1时，one是0、1交替改变
            three = one & two    #当one和two为1是，three为1（此时代表要把one和two清零了）
            one &= ~three        #把one清0
            two &= ~three        #把two清0
        return one
Resource: https://www.jianshu.com/p/758e799614b2