题目描述:
给定一个非空整数数组,除了某个元素只出现一次以外,其余每个元素均出现了三次。找出那个只出现了一次的元素。
示例 1:
输入: [2,2,3,2]
输出: 3
示例 2:
输入: [0,1,0,1,0,1,99]
输出: 99
解题思路1:
- 利用Counter,首先进行频数统计,然后将每一项列出来,并转化成列表的形式
- 依次遍历频数即可
代码1:
from collections import Counter
class Solution(object):
def singleNumber(self, nums):
nums = list(Counter(nums).items())
for i in range(len(nums)):
if nums[i][1] == 1:
return nums[i][0]
或者依次遍历键来找值
from collections import Counter
class Solution:
def singleNumber(self, nums):
hashmap = Counter(nums)
for k in hashmap.keys():
if hashmap[k] == 1:
return k
解题思路2:
- 遍历数据,用一个字典存储每个数字出现的次数
- 字典中出现次数为1的即为答案
代码2:
class Solution(object):
def singleNumber(self, nums):
dt = {}
for num in nums:
if num not in dt:
dt[num] = 1 # num是键,dt[num]是值
else:
dt[num] += 1
for key in dt:
if dt[key] == 1:
return key
s = Solution()
nums = [0,1,0,1,0,1,99]
print(s.singleNumber(nums))
解题思路3:
3×(a+b+c)−(a+a+a+b+b+b+c)=2c
代码3:
class Solution:
def singleNumber(self, nums):
return (3 * sum(set(nums)) - sum(nums)) // 2
参考链接: