1060. Missing Element in Sorted Array

Given a sorted array of distinct integers from 0 to n-1 (where n = nums.length), find the k-th missing positive number starting from the leftmost element of the array.

The missing numbers are positive integers that are not present in the array but would appear if you enumerated all positive integers from 1.

Examples
Input: [[4,7,9,10],1]
Output: 5
Hints
Related Problems

1060. Missing Element in Sorted Array

Given a sorted array of distinct integers from `0` to `n-1` (where `n = nums.length`), find the k-th missing positive number starting from the leftmost element of the array.