Leetcode # 1060. Missing Element in Sorted Array

https://leetcode.com/problems/missing-element-in-sorted-array

Solution

Time Complexity: O(len(nums))
Space Complexity: O(1)
(The input and output generally do not count towards the space complexity.)

class Solution:
  def missingElement(self, nums: List[int], k: int) -> int:
    cur, _k = nums, k
    for i in range(1, len(nums)):
      missing_number_n = nums[i] - nums[i - 1] - 1
      if _k <= missing_number_n:
        return nums[i - 1] + _k
      _k -= missing_number_n
    return nums[-1] + _k

Last Updated on 2023/08/16 by A1go