Kth Missing Positive Number

Easy

Given a strictly increasing array of positive integers nums and an integer target (= k), return the target-th positive integer that is missing from the array.

Example 1

Input:  nums = [2,3,4,7,11], target = 5
Output: 9

Example 2

Input:  nums = [1,2,3,4], target = 2
Output: 6

Constraints

• 1 <= nums.length <= 1000
• 1 <= nums[i] <= 1000
• nums is strictly increasing.
• 1 <= target <= 1000