package leetcode;

/**
 * https://leetcode.com/problems/advantage-shuffle/
 */
public class Problem870 {
    public int[] advantageCount(int[] A, int[] B) {
        // TODO
        return null;
    }

    public static void main(String[] args) {
        Problem870 prob = new Problem870();
    }
}

@@ -283,16 +283,248 @@
 m870();%0A
+        System.out.println(prob.advantageCount(new int%5B%5D%7B2, 7, 11, 15%7D, new int%5B%5D%7B1, 10, 4, 11%7D)); // %5B2,11,7,15%5D%0A        System.out.println(prob.advantageCount(new int%5B%5D%7B12, 24, 8, 32%7D, new int%5B%5D%7B13, 25, 32, 11%7D)); // %5B24,32,8,12%5D%0A
     %7D%0A%7D%0A

Update problem 870