add 1772

Author: fishercoder1534

README.md

@@ -10,6 +10,7 @@ _If you like this project, please leave me a star._ ★
 |-----|----------------|---------------|--------|-------------|-------------
 |1774|[Closest Dessert Cost](https://leetcode.com/problems/closest-dessert-cost/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1774.java) ||Medium|Greedy|
 |1773|[Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1773.java) ||Easy|Array, String|
+|1772|[Sort Features by Popularity](https://leetcode.com/problems/sort-features-by-popularity/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1772.java) ||Medium|HashTable, Sort|
 |1769|[Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1769.java) ||Medium|Array, Greedy|
 |1768|[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1768.java) ||Easy|String|
 |1765|[Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1765.java) ||Medium|BFS, Graph|

src/main/java/com/fishercoder/solutions/_1772.java

@@ -0,0 +1,50 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.Map;
+import java.util.PriorityQueue;
+import java.util.Set;
+
+public class _1772 {
+    public static class Solution1 {
+        public String[] sortFeatures(String[] features, String[] responses) {
+            Map<String, Integer> map = new HashMap<>();
+            for (int i = 0; i < features.length; i++) {
+                map.put(features[i], i);
+            }
+            Map<String, Integer> countMap = new HashMap<>();
+            for (String response : responses) {
+                Set<String> strs = new HashSet(Arrays.asList(response.split(" ")));
+                for (String str : strs) {
+                    if (map.containsKey(str)) {
+                        countMap.put(str, countMap.getOrDefault(str, 0) + 1);
+                    }
+                }
+            }
+            PriorityQueue<Node> maxHeap = new PriorityQueue<>((a, b) -> a.freq != b.freq ? b.freq - a.freq : a.index - b.index);
+            for (String key : map.keySet()) {
+                maxHeap.offer(new Node(key, countMap.getOrDefault(key, 0), map.get(key)));
+            }
+            String[] result = new String[features.length];
+            int i = 0;
+            while (!maxHeap.isEmpty()) {
+                result[i++] = maxHeap.poll().word;
+            }
+            return result;
+        }
+
+        class Node {
+            String word;
+            Integer freq;
+            Integer index;
+
+            public Node(String word, Integer freq, Integer index) {
+                this.word = word;
+                this.freq = freq;
+                this.index = index;
+            }
+        }
+    }
+}

src/test/java/com/fishercoder/_1772Test.java

@@ -0,0 +1,30 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1772;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertArrayEquals;
+
+public class _1772Test {
+    private static _1772.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1772.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertArrayEquals(new String[]{"touch", "cooler", "lock"},
+                solution1.sortFeatures(new String[]{"cooler", "lock", "touch"}, new String[]{"i like cooler cooler", "lock touch cool", "locker like touch"}));
+    }
+
+    @Test
+    public void test2() {
+
+        assertArrayEquals(new String[]{"a", "aa", "b", "c"},
+                solution1.sortFeatures(new String[]{"a", "aa", "b", "c"}, new String[]{"a", "a aa", "a a a a a", "b a"}));
+    }
+
+}