class Solution:
def findDisappearedNumbers(self, nums):
"""
:type nums: List[int]
:rtype: List[int]
"""
# method one 集合操作
return list(set(range(1, len(nums)+1)) - set(nums))
# method two
# s = set(nums) # 不能直接写成一行,效率太低
# return [i for i in range(1, len(nums)+1) if i not in s]
leetcode 448. Find All Numbers Disappeared in an Array 找到所有数组中消失的数字 python 最简一行代码 (集合的操作)
猜你喜欢
转载自blog.csdn.net/huhehaotechangsha/article/details/80839491
今日推荐
周排行