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.
Input: nums = [2,2,3,2] Output: 3
Input: nums = [0,1,0,1,0,1,99] Output: 99
1 <= nums.length <= 3 * 104
-231 <= nums[i] <= 231 - 1
- Each element in
numsappears exactly three times except for one element which appears once.
class Solution: def singleNumber(self, nums: List[int]) -> int: ht = collections.Counter(nums) for k,v in ht.items(): if v==1: return k