-
[leetcode 75-14] Missing NumberAlgorithm 2023. 1. 30. 22:56
https://leetcode.com/problems/missing-number/
Missing Number - LeetCode
Missing Number - 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 n
leetcode.com
class Solution: def missingNumber(self, nums: List[int]) -> int: n = len(nums) real_sum = n * (n+1) // 2 return real_sum - sum(nums)'Algorithm' 카테고리의 다른 글
[leetcode 75-16] Climbing Stairs (0) 2023.01.30 [leetcode 75-15] Reverse Bits (0) 2023.01.30 [leetcode 75-13] Counting Bits (1) 2023.01.30 [leetcode 75-12] Number of 1 Bits (0) 2023.01.30 [leetcode 75-11] Sum of Two Integers (0) 2023.01.30