题解
思路
代码
class Solution(object):
### 0914 分类讨论(32 ms,13.3 MB)
def missingNumber(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
if len(nums) == 1:
return 1 if nums[0] == 0 else 0
if nums[0] != 0:
return 0
if nums[-1] == len(nums) - 1:
return len(nums)
for i in range(len(nums)-1):
if nums[i+1] - nums[i] != 1:
return (nums[i+1] + nums[i]) / 2
### 0914 二分法(16 ms,13.3 MB)
def missingNumber(self, nums):
i, j = 0, len(nums) - 1
while i <= j:
m = (i + j) // 2
if nums[m] == m:
i = m + 1
else:
j = m - 1
return i