LeetCode 645 Set Mismatch (Python)

Posted by 小明MaxMing on March 2, 2021

题目

You have a set of integers s, which originally contains all the numbers from 1 to n. Unfortunately, due to some error, one of the numbers in s got duplicated to another number in the set, which results in repetition of one number and loss of another number.

You are given an integer array nums representing the data status of this set after the error.

Find the number that occurs twice and the number that is missing and return them in the form of an array.

解题思路

求出所有不同数的总和,重复数为总和减去不同数的总和,缺失的数为1到n的和,减去不同数的总和

代码

class Solution:
    def findErrorNums(self, nums: List[int]) -> List[int]:
        sum_unique = sum(set(nums))
        dup = sum(nums) - sum_unique
        miss = (len(nums) + 1) * len(nums) // 2 - sum_unique 
        return [dup, miss]

视频讲解 YouTube<--欢迎点击订阅

视频讲解 bilibili<--欢迎点击订阅