Package g1501_1600.s1539_kth_missing_positive_number

Class Solution

java.lang.Object

g1501_1600.s1539_kth_missing_positive_number.Solution

public class Solution
extends Object

1539 - Kth Missing Positive Number.<p>Easy</p> <p>Given an array <code>arr</code> of positive integers sorted in a <strong>strictly increasing order</strong> , and an integer <code>k</code>.</p> <p><em>Find the</em> <code>k^th</code> <em>positive integer that is missing from this array.</em></p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> arr = [2,3,4,7,11], k = 5</p> <p><strong>Output:</strong> 9</p> <p><strong>Explanation:</strong> The missing positive integers are [1,5,6,8,9,10,12,13,&hellip;]. The 5^th missing positive integer is 9.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> arr = [1,2,3,4], k = 2</p> <p><strong>Output:</strong> 6</p> <p><strong>Explanation:</strong> The missing positive integers are [5,6,7,&hellip;]. The 2^nd missing positive integer is 6.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= arr.length <= 1000</code></li> <li><code>1 <= arr[i] <= 1000</code></li> <li><code>1 <= k <= 1000</code></li> <li><code>arr[i] < arr[j]</code> for <code>1 <= i < j <= arr.length</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	findKthPositive(int[] arr, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

findKthPositive

public int findKthPositive(int[] arr,
 int k)