208 accepted. 269ms > 129ms

Author: aQua

Algorithms/0208.implement-trie-prefix-tree/README.md

@@ -0,0 +1,11 @@
+# [208. Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/)
+
+## 题目
+Implement a trie with insert, search, and startsWith methods.
+
+Note:
+You may assume that all inputs are consist of lowercase letters a-z.
+
+## 解题思路
+
+见程序注释

Algorithms/0208.implement-trie-prefix-tree/implement-trie-prefix-tree.go

@@ -0,0 +1,45 @@
+package Problem0208
+
+/**
+ * Your Trie object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.Insert(word);
+ * param_2 := obj.Search(word);
+ * param_3 := obj.StartsWith(prefix);
+ */
+
+// Trie 是便于 word 插入与查找的数据结构
+type Trie struct {
+	words []string
+}
+
+// Constructor initialize your data structure here.
+func Constructor() Trie {
+	return Trie{}
+}
+
+// Insert a word into the trie.
+func (t *Trie) Insert(word string) {
+	t.words = append(t.words, word)
+}
+
+// Search returns true if the word is in the trie.
+func (t *Trie) Search(word string) bool {
+	for _, w := range t.words {
+		if w == word {
+			return true
+		}
+	}
+	return false
+}
+
+// StartsWith returns true if there is any word in the trie that starts with the given prefix.
+func (t *Trie) StartsWith(prefix string) bool {
+	end := len(prefix)
+	for _, w := range t.words {
+		if len(w) >= end && w[:end] == prefix {
+			return true
+		}
+	}
+	return false
+}

Algorithms/0208.implement-trie-prefix-tree/implement-trie-prefix-tree_test.go

@@ -0,0 +1,28 @@
+package Problem0208
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+func Test_Constructor(t *testing.T) {
+	ast := assert.New(t)
+
+	trie := Constructor()
+
+	trie.Insert("abc")
+	// ["abc"]
+
+	ast.True(trie.Search("abc"), "Search abc in [abc]")
+	// ["abc"]
+
+	ast.False(trie.Search("abcd"), "Search abcd in [abc]")
+	// ["abc"]
+
+	ast.True(trie.StartsWith("abc"), "Search startWith abc in [abc]")
+	// ["abc"]
+
+	ast.False(trie.StartsWith("bc"), "Search startWith bc in [abc]")
+	// ["abc"]
+}