Package g1601_1700.s1673_find_the_most_competitive_subsequence

Class Solution

java.lang.Object
g1601_1700.s1673_find_the_most_competitive_subsequence.Solution
public class Solution extends Object
1673 - Find the Most Competitive Subsequence.<p>Medium</p> <p>Given an integer array <code>nums</code> and a positive integer <code>k</code>, return <em>the most <strong>competitive</strong> subsequence of</em> <code>nums</code> <em>of size</em> <code>k</code>.</p> <p>An array&rsquo;s subsequence is a resulting sequence obtained by erasing some (possibly zero) elements from the array.</p> <p>We define that a subsequence <code>a</code> is more <strong>competitive</strong> than a subsequence <code>b</code> (of the same length) if in the first position where <code>a</code> and <code>b</code> differ, subsequence <code>a</code> has a number <strong>less</strong> than the corresponding number in <code>b</code>. For example, <code>[1,3,4]</code> is more competitive than <code>[1,3,5]</code> because the first position they differ is at the final number, and <code>4</code> is less than <code>5</code>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [3,5,2,6], k = 2</p> <p><strong>Output:</strong> [2,6]</p> <p><strong>Explanation:</strong> 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.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [2,4,3,3,5,4,9,6], k = 4</p> <p><strong>Output:</strong> [2,3,3,4]</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10<sup>5</sup></code></li> <li><code>0 <= nums[i] <= 10<sup>9</sup></code></li> <li><code>1 <= k <= nums.length</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • mostCompetitive

      public int[] mostCompetitive(int[] nums, int k)