标签：than nums Subsequence competitive stack Most subsequence needRemoveCount Find

package LeetCode_1673

import java.util.*

/**
 * 1673. Find the Most Competitive Subsequence
 * https://leetcode.com/problems/find-the-most-competitive-subsequence/
 * 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.
 * */
class Solution {
    /*
    * solution: Stack,scan each number, check current num if large than then the first one in stack,
    * pop the large one, keep the increasing stack;
    * Time:O(n), Space:O(n)
    * */
    fun mostCompetitive(nums: IntArray, k: Int): IntArray {
        var needRemoveCount = nums.size - k
        val stack = Stack<Int>()
        for (i in nums.indices) {
            while (stack.isNotEmpty() && nums[i] < stack.peek() && needRemoveCount > 0) {
                stack.pop()
                needRemoveCount--
            }
            stack.push(nums[i])
        }
        //handle case some case, for example 1111
        while (needRemoveCount > 0) {
            stack.pop()
            needRemoveCount--
        }
        val result = IntArray(k)
        var index = k - 1
        //replace element from right to left,so no need to reverse
        while (stack.isNotEmpty()) {
            result[index--] = stack.pop()
        }
        return result
    }
}

标签：than,nums,Subsequence,competitive,stack,Most,subsequence,needRemoveCount,Find
来源： https://www.cnblogs.com/johnnyzhao/p/14078118.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。