题目:原题链接(中等)
标签:二分查找
解法 | 时间复杂度 | 空间复杂度 | 执行用时 |
---|---|---|---|
Ans 1 (Python) | O ( l o g N ) O(logN) O(logN) | O ( 1 ) O(1) O(1) | 56ms (55.75%) |
Ans 2 (Python) | |||
Ans 3 (Python) |
解法一:
class Solution:
def missingElement(self, nums: List[int], k: int) -> int:
size = len(nums)
if size == 1:
return nums[0] + k
left, right = 0, size
while left < right:
mid = (left + right) // 2
if nums[mid] < nums[0] + mid + k:
left = mid + 1
else:
right = mid
return nums[0] + left + k - 1