题目链接:https://leetcode-cn.com/problems/missing-number/
难度:简单

描述:
给定一个包含 [0, n]n 个数的数组 nums ,找出 [0, n] 这个范围内没有出现在数组中的那个数。

题解

  1. class Solution:
  2. def missingNumber(self, nums: List[int]) -> int:
  3. length = len(nums)
  4. ret = 0
  5. for i in range(length+1):
  6. ret = ret ^ i
  7. for i in nums:
  8. ret = ret ^ i
  9. return ret
  1. class Solution:
  2. def missingNumber(self, nums: List[int]) -> int:
  3. length = len(nums)
  4. ret = (length * (length + 1)) // 2
  5. for i in nums:
  6. ret -= i
  7. return ret