NeetCode #268LC-1060MediumBinary SearchNC Algo100
← Back to All Problems#268 · #1060 · Missing Element in Sorted Array(有序数组中的缺失元素)
📌 Problem Statement & Constraints
Given an integer array
nums sorted ascending with distinct values and an integer k, return the k-th missing number starting from nums[0]. Constraints: 1 <= nums.length <= 5 * 10^4, 1 <= k <= 10^8, 1 <= nums[i] <= 10^7.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!