268. Missing Number
Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.
Example 1
Input: [3,0,1]
Output: 2
Example 2
Input: [9,6,4,2,3,5,7,0,1]
Output: 8
Note:
Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?
思路:
这个题目主体是采用了之前的第 448 题的算法,然后区别是,这里给出的列表中都是不同的数字,只有少了一个数字,输出的是单个数字,而前面那题可能有重复和缺少多个数字,所以是一个列表,这里就用笨办法将列表中的数字直接取出再返回就行了。(下面也贴出了一个讨论区的代码,思路也很清楚,值得借鉴思考,但只是针对这个题目来的,如果题目有重复就不能用了)
我的代码:
class Solution:
def missingNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
L=list((set(range(0, len(nums)+1))).difference(set(nums)))
if L==[]:
return 1
else:
for i in L:
return i
讨论区代码:
class Solution:
def missingNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
n = len(nums)
return n * (n + 1) // 2 - sum(nums)