剑指Offer 53 - II. 【二分法】（有序数组）【0 ~ n-1】中缺失的 1 个数字（Easy）

LeetCode 448. 找到所有数组中消失的数字Easy/ 41. 缺失的第一个正数Hard【题目链接】题解n-1 中缺失的数字二分法清晰图解思路classSolution(object):### 0914 分类讨论32 ms13.3 MBdefmissingNumber(self,nums): :type nums: List[int] :rtype: int iflen(nums)1:return1ifnums[0]0else0ifnums[0]!0:return0ifnums[-1]len(nums)-1:returnlen(nums)foriinrange(len(nums)-1):ifnums[i1]-nums[i]!1:return(nums[i1]nums[i])/2### 0914 二分法16 ms13.3 MBdefmissingNumber(self,nums):i,j0,len(nums)-1whileij:m(ij)//2ifnums[m]m:im1else:jm-1returni