键值映射

Author: hero

leet_code/KvMapSum_test.go

@@ -1,6 +1,7 @@
 package leet_code
 
 import (
+	"fmt"
 	"testing"
 )
 
@@ -48,6 +49,7 @@ func (t *TireData) Insert(key string, val int) {
 	t.isEnd = true
 }
 func (t *TireData) Search(key string) (data []*TireData) {
+	//app
 	for _, v := range key {
 		if t.node[v] == nil {
 			return
@@ -61,6 +63,7 @@ func (t *TireData) Search(key string) (data []*TireData) {
 func GetNode(d *TireData, data *[]*TireData) {
 	if d.isEnd {
 		*data = append(*data, d)
+		fmt.Println("d", d.key)
 	}
 	for _, v := range d.node {
 		GetNode(v, data)
@@ -69,7 +72,7 @@ func GetNode(d *TireData, data *[]*TireData) {
 
 func Test_TireData(t *testing.T) {
 	var tire = &TireData{node: make(map[rune]*TireData, 26)}
-	tire.Insert("apl", 2)
+	tire.Insert("app", 2)
 	tire.Insert("apple", 3)
-	tire.Search("ap")
+	tire.Search("app")
 }

tree/tire_tree.go

@@ -13,8 +13,7 @@ func Constructor() Trie {
 func (t *Trie) Insert(word string) {
 	for _, v := range word {
 		if t.node[v] == nil { //没找到该节点
-			vt := &Trie{node: make(map[rune]*Trie, 26), isLast: false}
-			t.node[v] = vt
+			t.node[v] = &Trie{node: make(map[rune]*Trie, 26), isLast: false}
 		}
 		t = t.node[v] //找到节点，跳到下一个节点
 	}
@@ -45,7 +44,7 @@ func (t *Trie) StartsWith(prefix string) bool {
 func (t *Trie) StartsPrx(prefix string) (res *[]interface{}) {
 	for _, v := range prefix {
 		if t.node[v] == nil { //没找到该节点
-			break
+			return
 		}
 		t = t.node[v] //找到节点，跳到下一个节点
 	}

tree/tire_tree_test.go

@@ -5,12 +5,11 @@ import "testing"
 func TestTrie_Insert(t *testing.T) {
 	trie := Constructor()
 	trie.Insert("abp")
-	t.Log(trie.Search("apple"))
+	/*t.Log(trie.Search("apple"))
 	t.Log(trie.Search("app"))
-	t.Log(trie.StartsWith("app"))
-	trie.Insert("aee")
-	trie.Insert("aef")
-	t.Log(trie.SearchNode("ae"))
+	t.Log(trie.StartsWith("app"))*/
+	trie.Insert("aeef")
+	trie.Insert("aeff")
 	t.Log(trie.StartsPrx("ae"))
-
+	t.Log(trie.SearchNode("ae"))
 }