键值映射

Author: hero

leet_code/KvMapSum_test.go

@@ -0,0 +1,75 @@
+package leet_code
+
+import (
+	"testing"
+)
+
+//键值映射
+type MapSum struct {
+	tire *TireData
+}
+
+func Constructor() MapSum {
+	return MapSum{tire: &TireData{node: make(map[rune]*TireData, 26)}}
+}
+
+func (this *MapSum) Insert(key string, val int) {
+	this.tire.Insert(key, val)
+}
+
+func (this *MapSum) Sum(prefix string) int {
+	res := this.tire.Search(prefix)
+	if res == nil {
+		return 0
+	}
+	var data int
+	for _, v := range res {
+		data += v.val
+	}
+	return data
+}
+
+type TireData struct {
+	node  map[rune]*TireData
+	key   string
+	val   int
+	isEnd bool
+}
+
+func (t *TireData) Insert(key string, val int) {
+	for _, v := range key {
+		if t.node[v] == nil {
+			t.node[v] = &TireData{node: make(map[rune]*TireData, 26)}
+		}
+		t = t.node[v]
+	}
+	t.key = key
+	t.val = val
+	t.isEnd = true
+}
+func (t *TireData) Search(key string) (data []*TireData) {
+	for _, v := range key {
+		if t.node[v] == nil {
+			return
+		}
+		t = t.node[v]
+	}
+	GetNode(t, &data)
+	return data
+}
+
+func GetNode(d *TireData, data *[]*TireData) {
+	if d.isEnd {
+		*data = append(*data, d)
+	}
+	for _, v := range d.node {
+		GetNode(v, data)
+	}
+}
+
+func Test_TireData(t *testing.T) {
+	var tire = &TireData{node: make(map[rune]*TireData, 26)}
+	tire.Insert("apl", 2)
+	tire.Insert("apple", 3)
+	tire.Search("ap")
+}

tree/tire_tree.go

@@ -42,6 +42,28 @@ func (t *Trie) StartsWith(prefix string) bool {
 	return true
 }
 
+func (t *Trie) StartsPrx(prefix string) (res *[]interface{}) {
+	for _, v := range prefix {
+		if t.node[v] == nil { //没找到该节点
+			break
+		}
+		t = t.node[v] //找到节点，跳到下一个节点
+	}
+	res = &[]interface{}{}
+	GetStartsPrx(t, res)
+	return
+}
+
+func GetStartsPrx(t *Trie, res *[]interface{}) {
+	if t.isLast {
+		*res = append(*res, t.val)
+	}
+	for _, v := range t.node {
+		GetStartsPrx(v, res)
+	}
+	return
+}
+
 //查找数据
 func (t *Trie) SearchNode(key string) (res []interface{}) {
 	root := t

tree/tire_tree_test.go

@@ -8,8 +8,9 @@ func TestTrie_Insert(t *testing.T) {
 	t.Log(trie.Search("apple"))
 	t.Log(trie.Search("app"))
 	t.Log(trie.StartsWith("app"))
-	trie.Insert("abe")
+	trie.Insert("aee")
 	trie.Insert("aef")
 	t.Log(trie.SearchNode("ae"))
+	t.Log(trie.StartsPrx("ae"))
 
 }