Leetcode 137. Single Number II

Problem

Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it.

You must implement a solution with a linear runtime complexity and use only constant extra space.

Algorithm

Using trinary solving, all numbers are converted to trinary. Adding each digit and taking the remainder of the pair of three, sum them up to the result. A special treatment is required when taking the remainder of a negative number. To reduce space, scanning by digit.

Code

class Solution:
    def singleNumber(self, nums: List[int]) -> int:
        sLen = len(nums)
        p_cnt, n_cnt = 0, 0
        for i in range(sLen):
            p_cnt += (nums[i] > 0)
            n_cnt += (nums[i] < 0)
        
        if p_cnt % 3 == 0:
            if n_cnt % 3 == 0:
                return 0
            else:
                ans = 0
                base = 1
                for k in range(20):
                    val = 0
                    for i in range(sLen):
                        if nums[i] < 0:
                            val += ((-1-nums[i]) // base) % 3
                    ans += val % 3 * base
                    base *= 3
                return -1-ans
        else:
            ans = 0
            base = 1
            for k in range(20):
                val = 0
                for i in range(sLen):
                    if nums[i] > 0:
                        val += nums[i] // base % 3
                ans += val % 3 * base
                base *= 3
            return ans
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值