Package g1501_1600.s1539_kth_missing_positive_number

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1539 - Kth Missing Positive Number\.

    Easy

    Given an array arr of positive integers sorted in a strictly increasing order , and an integer k.

    Find the <code>k<sup>th</sup></code> positive integer that is missing from this array.

    Example 1:

    Input: arr = 2,3,4,7,11, k = 5

    Output: 9

    Explanation: The missing positive integers are 1,5,6,8,9,10,12,13,.... The 5<sup>th</sup> missing positive integer is 9.

    Example 2:

    Input: arr = 1,2,3,4, k = 2

    Output: 6

    Explanation: The missing positive integers are 5,6,7,.... The 2<sup>nd</sup> missing positive integer is 6.

    Constraints:

    • 1 &lt;= arr.length &lt;= 1000

    • 1 &lt;= arr[i] &lt;= 1000

    • 1 &lt;= k &lt;= 1000

    • arr[i] &lt; arr[j] for 1 &lt;= i &lt; j &lt;= arr.length

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer findKthPositive(IntArray arr, Integer k)

      • Methods inherited from class java.lang.Object

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