leetcode-缺失的数字

缺失数字

给定一个包含 0, 1, 2, ..., n 中 n 个数的序列，找出 0 .. n 中没有出现在序列中的那个数。

示例 1:

输入: [3,0,1]
输出: 2
示例 2:

输入: [9,6,4,2,3,5,7,0,1]
输出: 8

Python：

利用字典加速搜索：

from collections import Counter
class Solution:
    def missingNumber(self,nums ):
        max_1 = max(nums)
        nums = dict(Counter(nums))
        num_2 =[]
        for i in range(max_1):
            num_2.append(i)
        num_2 = dict(Counter(num_2))
        cont=0
        for j in num_2:
            if j not in nums:
                cont+=1
                return j
        if cont<=0:
            return max_1+1
        

class Solution:
    def missingNumber(self, nums):
        num_set = set(nums)
        n = len(nums) + 1
        for number in range(n):
            if number not in num_set:
                return number

利用求和求出缺失值：

class Solution(object):
    def missingNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        return sum([i for i in range(len(nums)+1)])-sum(nums)