268. Missing Number

Sterben_Da

已于 2022-06-13 15:07:58 修改

阅读量115

点赞数

分类专栏： leetcode-python 文章标签： leetcode python 算法

于 2022-06-13 15:00:14 首次发布

本文链接：https://blog.csdn.net/Sterben_Da/article/details/125260290

版权

leetcode-python 专栏收录该内容

99 篇文章 0 订阅

订阅专栏

该博客介绍了一种解决编程问题的方法，即在给定一个包含[0,n]范围内n个不同整数的数组时，如何找到缺失的唯一数字。通过利用异或操作的性质，可以在O(n)的时间复杂度和O(1)的空间复杂度下找到缺失的数字。此外，还提到了使用高斯求和公式作为另一种解决方案。

摘要由CSDN通过智能技术生成

268. Missing Number

Easy

62492891Add to ListShare

Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.

Example 1:

Input: nums = [3,0,1]
Output: 2
Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.

Example 2:

Input: nums = [0,1]
Output: 2
Explanation: n = 2 since there are 2 numbers, so all numbers are in the range [0,2]. 2 is the missing number in the range since it does not appear in nums.

Example 3:

Input: nums = [9,6,4,2,3,5,7,0,1]
Output: 8
Explanation: n = 9 since there are 9 numbers, so all numbers are in the range [0,9]. 8 is the missing number in the range since it does not appear in nums.

Constraints:

n == nums.length
1 <= n <= 104
0 <= nums[i] <= n
All the numbers of nums are unique.

Follow up: Could you implement a solution using only O(1) extra space complexity and O(n) runtime complexity?

class Solution:
    def missingNumber(self, nums: List[int]) -> int:
        """
        assert Solution().missingNumber([3, 0, 1]) == 2
        assert Solution().missingNumber([9, 6, 4, 2, 3, 5, 7, 0, 1]) == 8

        解题思路：异或的自反性，对所有nums数字异或，同时对[0,n]数字异或，结果就是缺少的数字
        时间复杂度：O(n)，空间复杂度：O(1)

        别的解题思路：高斯求和公式 1+2+....+n = n(n+1)/2
        """
        # mask = len(nums)
        # for i in range(0, len(nums)):
        #     mask ^= i ^ nums[i]
        # return mask

        n = len(nums)
        result = int(n * (n + 1) / 2)
        for i in nums:
            result -= i
        return result