题目描述
https://leetcode-cn.com/problems/que-shi-de-shu-zi-lcof/
思路题解
速度都差不多
我的方法:递归二分
class Solution:
def missingNumber(self, nums: List[int]) -> int:
def binsearch(i,j):
if i==j:return i
m=(i+j)//2
if nums[m]==(i+j)//2:
return binsearch(m+1,j)
else:return binsearch(i,m)
if nums[-1]==len(nums)-1:return len(nums)
return binsearch(0,len(nums)-1)
大佬的方法:循环二分
class Solution:
def missingNumber(self, nums: List[int]) -> int:
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