给定一个包含 0, 1, 2, ..., n
中 n 个数的序列,找出 0 .. n 中没有出现在序列中的那个数
Example 1:
Input: [3,0,1] Output: 2Example 2:
Input: [9,6,4,2,3,5,7,0,1] Output: 8
注意:
必须在线性时间复杂度内完成,尝试用常数阶额外空间完成
1:申请len(nums)+1长度的数组用于标记,两次for循环完成工作。时间复杂度O(n),空间复杂度O(n)
def missingNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
checkList = [False] * (len(nums) + 1)
for i in nums:
checkList[i] = True
for i, j in enumerate(checkList):
if not j:
return i
2:0~n,满足等差数列公式(参考他人)
def missingNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
return (len(nums) * (len(nums)+1) // 2) - sum(nums)
3:^位运算(参考他人)
def missingNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
bit = 0
for i, j in enumerate(nums):
bit ^= i ^ j
return bit ^ len(nums)
4:set()方法(参考他人)
def missingNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
return (set(range(len(nums) + 1)) - set(nums)).pop()
算法题来自:https://leetcode-cn.com/problems/missing-number/description/