add 1471

fishercoder1534 · fishercoder1534 · commit 988788cee66e · 2020-06-07T10:15:45.000-07: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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1471|[The k Strongest Values in an Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1471.java) | |Medium|Array, Sort|
 |1470|[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1470.java) | |Easy|Array|
 |1466|[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1466.java) | |Medium|Tree, DFS|
 |1464|[Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1464.java) | |Easy|Array|
diff --git a/src/main/java/com/fishercoder/solutions/_1471.java b/src/main/java/com/fishercoder/solutions/_1471.java
@@ -0,0 +1,35 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.List;
+import java.util.TreeMap;
+
+public class _1471 {
+    public static class Solution1 {
+        public int[] getStrongest(int[] arr, int k) {
+            Arrays.sort(arr);
+            int median = arr.length % 2 != 0 ? arr[arr.length / 2] : arr[arr.length / 2 - 1];
+            TreeMap<Integer, List<Integer>> treeMap = new TreeMap<>(Collections.reverseOrder());
+            for (int num : arr) {
+                int diff = Math.abs(num - median);
+                if (!treeMap.containsKey(diff)) {
+                    treeMap.put(diff, new ArrayList<>());
+                }
+                treeMap.get(diff).add(num);
+            }
+            List<Integer> sorted = new ArrayList<>();
+            for (int key : treeMap.keySet()) {
+                List<Integer> sort = treeMap.get(key);
+                Collections.sort(sort, Collections.reverseOrder());
+                sorted.addAll(sort);
+            }
+            int[] result = new int[k];
+            for (int i = 0; i < k; i++) {
+                result[i] = sorted.get(i);
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1471Test.java b/src/test/java/com/fishercoder/_1471Test.java
@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1471;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1471Test {
+    private static _1471.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1471.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{1, 2, 3, 4, 5};
+        assertArrayEquals(new int[]{5, 1}, solution1.getStrongest(nums, 2));
+    }
+
+}
