_1673.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.Stack;

publicclass_1673 {
publicstaticclassSolution1 {
publicint[] mostCompetitive(int[] nums, intk) {
Stack<Integer> stack = newStack<>();
for (inti = 0; i < nums.length; i++) {
while (!stack.isEmpty()
 && nums[i] < stack.peek()
 && nums.length - i + stack.size() > k) {
stack.pop();
 }
if (stack.size() < k) {
stack.push(nums[i]);
 }
 }
int[] result = newint[k];
for (inti = k - 1; i >= 0; i--) {
result[i] = stack.pop();
 }
returnresult;
 }
 }
}