版权声明:本文为博主原创文章,请尊重原创,转载请注明原文地址和作者信息! https://blog.csdn.net/zzc15806/article/details/82414642
class Solution:
#等差数列求和思想
def missingNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
seriesSum = (len(nums)+1)*len(nums) / 2
return int(seriesSum-sum(nums))
class Solution:
# 使用集合操作
def missingNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
full_set = set(range(len(nums)+1))
in_set = set(nums)
return (full_set-in_set).pop()