268. Missing Number

最新推荐文章于 2023-04-29 13:49:22 发布

Yingying_code

最新推荐文章于 2023-04-29 13:49:22 发布

阅读量183

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/alwaystry/article/details/52184319

leetcode 专栏收录该内容

261 篇文章

订阅专栏

本文介绍了一种算法，用于从包含n个不同整数的数组中找到缺失的一个数字，这些整数取自0到n的范围。提供了两种解决方案：一种使用算术级数求和公式，另一种利用排序后的数组进行查找。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.

For example,
Given nums = [0, 1, 3] return 2.

Note:

Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?

My code：

    def missingNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        n = len(nums)+1
        return  n*(n-1)/2 -sum(nums)

overflow

    def missingNumber(self, nums):
        nums.sort()
        for i in range (0,len(nums)):
            if nums[i]^ i !=0:
                return i
        return 0

https://discuss.leetcode.com/topic/23427/3-different-ideas-xor-sum-binary-search-java-code/2

    def missingNumber(self, nums):
        nums.sort()
        left = 0
        right = len(nums)
        mid = (left+right)/2
        while left<right:
            mid = (left+right)/2
            if (nums[mid]>mid):
                right = mid
            else:
                left = mid +1
        return left