fd

Author: dingjikerbo

test/src/main/java/com/inuker/test/Test2.java

@@ -20,14 +20,81 @@
 
 public class Test2 {
 
-    class WordDistance {
+    public class AutocompleteSystem {
 
-        public WordDistance(String[] words) {
-            HashMap<String, List<>>
+        class TrieNode {
+            Map<Character, TrieNode> children;
+            Map<String, Integer> counts;
+            boolean isWord;
+            public TrieNode() {
+                children = new HashMap<Character, TrieNode>();
+                counts = new HashMap<String, Integer>();
+                isWord = false;
+            }
         }
 
-        public int shortest(String word1, String word2) {
+        class Pair {
+            String s;
+            int c;
+            public Pair(String s, int c) {
+                this.s = s; this.c = c;
+            }
+        }
+
+        TrieNode root;
+        String prefix;
+
+
+        public AutocompleteSystem(String[] sentences, int[] times) {
+            root = new TrieNode();
+            prefix = "";
+
+            for (int i = 0; i < sentences.length; i++) {
+                add(sentences[i], times[i]);
+            }
+        }
+
+        private void add(String s, int count) {
+            TrieNode curr = root;
+            for (char c : s.toCharArray()) {
+                TrieNode next = curr.children.get(c);
+                if (next == null) {
+                    next = new TrieNode();
+                    curr.children.put(c, next);
+                }
+                curr = next;
+                curr.counts.put(s, curr.counts.getOrDefault(s, 0) + count);
+            }
+            curr.isWord = true;
+        }
+
+        public List<String> input(char c) {
+            if (c == '#') {
+                add(prefix, 1);
+                prefix = "";
+                return new ArrayList<String>();
+            }
+
+            prefix = prefix + c;
+            TrieNode curr = root;
+            for (char cc : prefix.toCharArray()) {
+                TrieNode next = curr.children.get(cc);
+                if (next == null) {
+                    return new ArrayList<String>();
+                }
+                curr = next;
+            }
+
+            PriorityQueue<Pair> pq = new PriorityQueue<>((a, b) -> (a.c == b.c ? a.s.compareTo(b.s) : b.c - a.c));
+            for (String s : curr.counts.keySet()) {
+                pq.add(new Pair(s, curr.counts.get(s)));
+            }
 
+            List<String> res = new ArrayList<String>();
+            for (int i = 0; i < 3 && !pq.isEmpty(); i++) {
+                res.add(pq.poll().s);
+            }
+            return res;
         }
     }
 }

test/src/main/java/com/inuker/test/main.java

@@ -27,17 +27,6 @@
 public class main {
 
     public static void main(String[] args) {
-        double[] result = new Test2().calcEquation(new String[][] {
-                {"a", "b"},
-                {"b", "c"}
-        }, new double[] {
-                2.0f, 3.0f
-        }, new String[][] {
-                {"a", "c"},
-                {"b", "c"}
-        });
-        for (double f : result) {
-            System.out.print(f + " ");
-        }
+
     }
 }