Python中查找有序数列(整数数列)中缺失的最小数方法之set与二分法比较
补全从0开始的整数数列二分法查找最小缺失值:
def missingNumber(nums):
begin = 0
end = len(nums) - 1
while begin < end:
mid = (begin + end) // 2
if nums[mid] == mid:
begin = mid + 1
else:
end = mid
return begin if nums[begin] != begin else begin + 1