add 1673

fishercoder1534 · fishercoder1534 · commit 0430ec7c33e1 · 2020-11-29T08:59:52.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1673|[Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1673.java) ||Medium|Stack, Greedy|
 |1672|[Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1672.java) ||Easy|Array|
 |1669|[Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1669.java) ||Medium|LinedList|
 |1668|[Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1668.java) ||Easy|String|
diff --git a/src/main/java/com/fishercoder/solutions/_1673.java b/src/main/java/com/fishercoder/solutions/_1673.java
@@ -0,0 +1,24 @@
+package com.fishercoder.solutions;
+
+import java.util.Stack;
+
+public class _1673 {
+    public static class Solution1 {
+        public int[] mostCompetitive(int[] nums, int k) {
+            Stack<Integer> stack = new Stack<>();
+            for (int i = 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 = new int[k];
+            for (int i = k - 1; i >= 0; i--) {
+                result[i] = stack.pop();
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1673Test.java b/src/test/java/com/fishercoder/_1673Test.java
@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1673;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1673Test {
+    private static _1673.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1673.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new int[]{2, 6}, solution1.mostCompetitive(new int[]{3, 5, 2, 6}, 2));
+    }
+
+    @Test
+    public void test2() {
+        assertArrayEquals(new int[]{2, 3, 3, 4}, solution1.mostCompetitive(new int[]{2, 4, 3, 3, 5, 4, 9, 6}, 4));
+    }
+
+}
