feat: add solutions to lc problem: No.1858

No.1858.Longest Word With All Prefixes

Author: yanglbme

Diff for: solution/1800-1899/1858.Longest Word With All Prefixes/README.md

@@ -51,22 +51,206 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：前缀树**
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
+class Trie:
+    def __init__(self):
+        self.children = [None] * 26
+        self.is_end = False
+
+    def insert(self, w):
+        node = self
+        for c in w:
+            idx = ord(c) - ord("a")
+            if node.children[idx] is None:
+                node.children[idx] = Trie()
+            node = node.children[idx]
+        node.is_end = True
+
+    def search(self, w):
+        node = self
+        for c in w:
+            idx = ord(c) - ord("a")
+            node = node.children[idx]
+            if not node.is_end:
+                return False
+        return True
+
 
+class Solution:
+    def longestWord(self, words: List[str]) -> str:
+        trie = Trie()
+        for w in words:
+            trie.insert(w)
+        ans = ""
+        for w in words:
+            if ans and (len(ans) > len(w) or (len(ans) == len(w) and ans < w)):
+                continue
+            if trie.search(w):
+                ans = w
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Trie {
+    Trie[] children = new Trie[26];
+    boolean isEnd;
+
+    void insert(String w) {
+        Trie node = this;
+        for (char c : w.toCharArray()) {
+            c -= 'a';
+            if (node.children[c] == null) {
+                node.children[c] = new Trie();
+            }
+            node = node.children[c];
+        }
+        node.isEnd = true;
+    }
+
+    boolean search(String w) {
+        Trie node = this;
+        for (char c : w.toCharArray()) {
+            c -= 'a';
+            node = node.children[c];
+            if (!node.isEnd) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+
+class Solution {
+    public String longestWord(String[] words) {
+        Trie trie = new Trie();
+        for (String w : words) {
+            trie.insert(w);
+        }
+        String ans = "";
+        for (String w : words) {
+            if (!"".equals(ans) && (ans.length() > w.length() || (ans.length() == w.length() && ans.compareTo(w) < 0))) {
+                continue;
+            }
+            if (trie.search(w)) {
+                ans = w;
+            }
+        }
+        return ans;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Trie {
+private:
+    vector<Trie*> children;
+    bool isEnd;
+public:
+    Trie() : children(26), isEnd(false) {}
+    
+    void insert(string word) {
+        Trie* node = this;
+        for (char c : word)
+        {
+            c -= 'a';
+            if (!node->children[c]) node->children[c] = new Trie();
+            node = node->children[c];
+        }
+        node->isEnd = true;
+    }
+    
+    bool search(string word) {
+        Trie* node = this;
+        for (char c : word)
+        {
+            c -= 'a';
+            node = node->children[c];
+            if (!node->isEnd) return false;
+        }
+        return true;
+    }
+};
+
+class Solution {
+public:
+    string longestWord(vector<string>& words) {
+        Trie* trie = new Trie();
+        for (auto w : words) trie->insert(w);
+        string ans = "";
+        for (auto w : words)
+        {
+            if (ans != "" && (ans.size() > w.size() || (ans.size() == w.size() && ans < w))) continue;
+            if (trie->search(w)) ans = w;
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+type Trie struct {
+	children [26]*Trie
+	isEnd    bool
+}
+
+func newTrie() *Trie {
+	return &Trie{}
+}
+func (this *Trie) insert(word string) {
+	node := this
+	for _, c := range word {
+		c -= 'a'
+		if node.children[c] == nil {
+			node.children[c] = newTrie()
+		}
+		node = node.children[c]
+	}
+	node.isEnd = true
+}
+func (this *Trie) search(word string) bool {
+	node := this
+	for _, c := range word {
+		c -= 'a'
+		node = node.children[c]
+		if !node.isEnd {
+			return false
+		}
+	}
+	return true
+}
 
+func longestWord(words []string) string {
+	trie := newTrie()
+	for _, w := range words {
+		trie.insert(w)
+	}
+	ans := ""
+	for _, w := range words {
+		if ans != "" && (len(ans) > len(w) || (len(ans) == len(w) && ans < w)) {
+			continue
+		}
+		if trie.search(w) {
+			ans = w
+		}
+	}
+	return ans
+}
 ```
 
 ### **...**