add a solution for 1268

Author: fishercoder1534

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

@@ -85,4 +85,79 @@ public TrieNode(char c) {
             }
         }
     }
+
+    public static class Solution2 {
+        public List<List<String>> suggestedProducts(String[] products, String searchWord) {
+            TrieNode root = buildTrie(products);
+            List<List<String>> result = new ArrayList<>();
+            for (int i = 1; i <= searchWord.length(); i++) {
+                String searchTerm = searchWord.substring(0, i);
+                TrieNode tmp = root;
+                List<String> searchResult = new ArrayList<>();
+                for (int j = 0; j < searchTerm.length(); j++) {
+                    char c = searchTerm.charAt(j);
+                    if (tmp.children[c - 'a'] == null) {
+                        break;
+                    } else {
+                        tmp = tmp.children[c - 'a'];
+                    }
+                    if (j == searchTerm.length() - 1) {
+                        searchResult.addAll(findAllWords(tmp, searchTerm));
+                    }
+                }
+                result.add(searchResult.size() > 3 ? searchResult.subList(0, 3) : searchResult);
+            }
+            return result;
+        }
+
+        private List<String> findAllWords(TrieNode trieNode, String prefix) {
+            List<String> result = new ArrayList<>();
+            if (trieNode.isWord) {
+                result.add(prefix);
+                if (result.size() > 3) {
+                    return result;
+                }
+            }
+            for (TrieNode node : trieNode.children) {
+                if (node != null) {
+                    result.addAll(findAllWords(node, prefix + node.val));
+                    if (result.size() > 3) {
+                        return result;
+                    }
+                }
+            }
+            return result;
+        }
+
+        private TrieNode buildTrie(String[] words) {
+            TrieNode root = new TrieNode(' ');
+            for (String word : words) {
+                TrieNode tmp = root;
+                for (int i = 0; i < word.length(); i++) {
+                    char c = word.charAt(i);
+                    if (tmp.children[c - 'a'] == null) {
+                        tmp.children[c - 'a'] = new TrieNode(c);
+                    }
+                    tmp = tmp.children[c - 'a'];
+                    if (i == word.length() - 1) {
+                        tmp.isWord = true;
+                    }
+                }
+
+            }
+            return root;
+        }
+
+        public class TrieNode {
+            TrieNode[] children;
+            char val;
+            boolean isWord;
+
+            public TrieNode(char val) {
+                this.children = new TrieNode[26];
+                this.val = val;
+                this.isWord = false;
+            }
+        }
+    }
 }