add 870

fishercoder1534 · fishercoder1534 · commit facf8dc597e7 · 2021-03-24T08:23:14.000-07:00
diff --git a/README.md b/README.md
@@ -420,6 +420,7 @@ _If you like this project, please leave me a star._ &#9733;
 |877|[Stone Game](https://leetcode.com/problems/stone-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_877.java) | |Medium| Math, DP, Minimax
 |876|[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_876.java) | |Easy|
 |872|[Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_872.java) |  |Easy| DFS, recursion
+|870|[Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_870.java) |  |Medium|Array, Greedy
 |868|[Binary Gap](https://leetcode.com/problems/binary-gap/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_868.java) |  |Easy|
 |867|[Transpose Matrix](https://leetcode.com/problems/transpose-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_867.java) |  |Easy|
 |860|[Lemonade Change](https://leetcode.com/problems/lemonade-change/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_860.java) | |Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_870.java b/src/main/java/com/fishercoder/solutions/_870.java
@@ -0,0 +1,42 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Iterator;
+import java.util.List;
+
+public class _870 {
+    public static class Solution1 {
+        public int[] advantageCount(int[] A, int[] B) {
+            int[] result = new int[A.length];
+            Arrays.sort(A);
+            boolean[] used = new boolean[A.length];
+            for (int i = 0; i < A.length; i++) {
+                result[i] = findSmallestAdvantage(A, used, B[i]);
+            }
+            List<Integer> unused = new ArrayList<>();
+            for (int i = 0; i < A.length; i++) {
+                if (!used[i]) {
+                    unused.add(A[i]);
+                }
+            }
+            Iterator<Integer> iterator = unused.iterator();
+            for (int i = 0; i < A.length; i++) {
+                if (result[i] == -1) {
+                    result[i] = iterator.next();
+                }
+            }
+            return result;
+        }
+
+        private int findSmallestAdvantage(int[] A, boolean[] used, int target) {
+            for (int i = 0; i < A.length; i++) {
+                if (!used[i] && A[i] > target) {
+                    used[i] = true;
+                    return A[i];
+                }
+            }
+            return -1;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_870Test.java b/src/test/java/com/fishercoder/_870Test.java
@@ -0,0 +1,34 @@
+package com.fishercoder;
+
+import com.fishercoder.common.utils.CommonUtils;
+import com.fishercoder.solutions._1758;
+import com.fishercoder.solutions._870;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _870Test {
+    private static _870.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _870.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        CommonUtils.printArray(solution1.advantageCount(new int[]{2, 7, 11, 15}, new int[]{1, 10, 4, 11}));
+    }
+
+    @Test
+    public void test2() {
+        CommonUtils.printArray(solution1.advantageCount(new int[]{12, 24, 8, 32}, new int[]{13, 25, 32, 11}));
+    }
+
+    @Test
+    public void test3() {
+        CommonUtils.printArray(solution1.advantageCount(new int[]{15, 15, 4, 5, 0, 1, 7, 10, 3, 1, 10, 10, 8, 2, 3}, new int[]{4, 13, 14, 0, 14, 14, 12, 3, 15, 12, 2, 0, 6, 9, 0}));
+    }
+
+}
