목록268. Missing Number (1)

Scribbling

LeetCode: 268. Missing Number

The first solution is using binary search. class Solution: def missingNumber(self, nums: List[int]) -> int: left, right = 0, len(nums) while left < right: mid = (left + right) // 2 cnt = 0 for num in nums: if num int: ret = len(nums) * (len(nums) + 1) // 2 for num in nums: ret -= num return ret
Computer Science/Coding Test 2022. 1. 4. 14:59
이전 Prev 1 Next 다음