Re: [閒聊] 每日LeetCode

[JerryChungYC (JerryChung)]

https://leetcode.com/problems/missing-number/

268. Missing Number

給一個包含[0, n]範圍內不同數字的陣列nums，傳回範圍內唯一缺少的數字

Example 1:
Input: nums = [3,0,1]
Output: 2

Example 2:
Input: nums = [0,1]
Output: 2

Example 3:
Input: nums = [9,6,4,2,3,5,7,0,1]
Output: 8

Python3 code:
--------------------------------------------------------
class Solution:
    def missingNumber(self, nums: List[int]) -> int:
        return (len(nums)*(len(nums)+1)//2) - sum(nums)
--------------------------------------------------------

計算0~n的總和-nums的總和

每日的題目是人選的還是隨機的啊

--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 114.45.48.107 (臺灣)
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1708417832.A.501.html
推 wu10200512: 大師
→ JIWP: 大師