Package g1601_1700.s1673_find_the_most_competitive_subsequence

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1673 - Find the Most Competitive Subsequence.

    Medium

    Given an integer array nums and a positive integer k, return the most competitive subsequence of nums of size k.

    An array's subsequence is a resulting sequence obtained by erasing some (possibly zero) elements from the array.

    We define that a subsequence a is more competitive than a subsequence b (of the same length) if in the first position where a and b differ, subsequence a has a number less than the corresponding number in b. For example, [1,3,4] is more competitive than [1,3,5] because the first position they differ is at the final number, and 4 is less than 5.

    Example 1:

    Input: nums = 3,5,2,6, k = 2

    Output: 2,6

    Explanation: Among the set of every possible subsequence: {3,5, 3,2, 3,6, 5,2, 5,6, 2,6}, 2,6 is the most competitive.

    Example 2:

    Input: nums = 2,4,3,3,5,4,9,6, k = 4

    Output: 2,3,3,4

    Constraints:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • <code>0 <= numsi<= 10<sup>9</sup></code>

    • 1 &lt;= k &lt;= nums.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 IntArray mostCompetitive(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

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