数组中只出现一次的两个数字
拟人算法系列文章,以容易理解的方式描述算法,点赞收藏不迷路
class Solution:
def FindNumsAppearOnce(self, nums: list[int]) -> list[int]:
count = {}
for num in nums:
if num in count:
count[num] += 1
else:
count[num] = 1
res = []
for num in count:
if count[num] == 1:
res.append(num)
res.sort()
return res
if __name__ == '__main__':
nums = [1, 4, 1, 6]
s = Solution()
print(s.FindNumsAppearOnce(nums)) # [4, 6]
先用 dict 统计每个数字的次数,然后再过一遍找到数量为 1 的存入结果