题目链接:https://leetcode-cn.com/problems/missing-number/
难度:简单
描述:
给定一个包含 [0, n]
中 n
个数的数组 nums
,找出 [0, n]
这个范围内没有出现在数组中的那个数。
题解
class Solution:
def missingNumber(self, nums: List[int]) -> int:
length = len(nums)
ret = 0
for i in range(length+1):
ret = ret ^ i
for i in nums:
ret = ret ^ i
return ret
class Solution:
def missingNumber(self, nums: List[int]) -> int:
length = len(nums)
ret = (length * (length + 1)) // 2
for i in nums:
ret -= i
return ret