update 146 Solution.go

Author: Cori1109

leetcode/1-100/0072.Edit-Distance/Solution.go

@@ -1,7 +1,5 @@
 package Solution
 
-import "fmt"
-
 /*
 	设状态为dp[i][j],表示A[0,i]与B[0,j]的最小编辑距离，对应形式分别为str1c,str2d
 	如果c==d,f[i][j]=f[i-1][j-1]
@@ -41,13 +39,6 @@ func minDistance(word1 string, word2 string) int {
 	return dp[m][n]
 }
 
-func Print(arr [][]int) {
-	for i := 0; i < len(arr); i++ {
-		fmt.Println(arr[i])
-	}
-	fmt.Println()
-}
-
 func min(x, y int) int {
 	if x > y {
 		return y

leetcode/101-200/0146.LRU-Cache/Solution.go

@@ -1,50 +1,82 @@
 package Solution
 
-import (
-	"container/list"
-	"fmt"
-)
-
 type LRUCache struct {
-	Capacity int
-	Data     *list.List
-	//*list.List
+	size       int
+	capacity   int
+	cache      map[int]*DLinkedNode
+	head, tail *DLinkedNode
+}
+
+type DLinkedNode struct {
+	key, value int
+	prev, next *DLinkedNode
+}
+
+func initDLinkedNode(key, value int) *DLinkedNode {
+	return &DLinkedNode{
+		key:   key,
+		value: value,
+	}
 }
 
 func Constructor(capacity int) LRUCache {
-	lru := LRUCache{
-		Capacity: capacity,
-		Data:     list.New(),
+	l := LRUCache{
+		cache:    map[int]*DLinkedNode{},
+		head:     initDLinkedNode(0, 0),
+		tail:     initDLinkedNode(0, 0),
+		capacity: capacity,
 	}
-	return lru
+	l.head.next = l.tail
+	l.tail.prev = l.head
+	return l
 }
 
 func (this *LRUCache) Get(key int) int {
-	for e := this.Data.Front(); e != nil; e = e.Next() {
-
-		//fmt.Println(key, e.Value.(list.Element).Value.(map[int]int)[key])
-
-		if v, ok := e.Value.(list.Element).Value.(map[int]int)[key]; ok {
-			this.Data.MoveBefore(e, this.Data.Front())
-			return v
-		}
+	if _, ok := this.cache[key]; !ok {
+		return -1
 	}
-	return -1
+	node := this.cache[key]
+	this.moveToHead(node)
+	return node.value
 }
 
 func (this *LRUCache) Put(key int, value int) {
-	this.Data.PushFront(
-		list.Element{
-			Value: map[int]int{key: value},
-		},
-	)
-	if this.Data.Len() > this.Capacity {
-		this.Data.Remove(this.Data.Back())
+	if _, ok := this.cache[key]; !ok {
+		node := initDLinkedNode(key, value)
+		this.cache[key] = node
+		this.addToHead(node)
+		this.size++
+		if this.size > this.capacity {
+			removed := this.removeTail()
+			delete(this.cache, removed.key)
+			this.size--
+		}
+	} else {
+		node := this.cache[key]
+		node.value = value
+		this.moveToHead(node)
 	}
 }
 
-func (this *LRUCache) Print() {
-	for e := this.Data.Front(); e != nil; e = e.Next() {
-		fmt.Println(e.Value.(list.Element).Value.(map[int]int))
-	}
+func (this *LRUCache) addToHead(node *DLinkedNode) {
+	node.prev = this.head
+	node.next = this.head.next
+	this.head.next.prev = node
+	this.head.next = node
+}
+
+func (this *LRUCache) removeNode(node *DLinkedNode) {
+	node.prev.next = node.next
+	node.next.prev = node.prev
+}
+
+func (this *LRUCache) moveToHead(node *DLinkedNode) {
+	this.removeNode(node)
+	this.addToHead(node)
+}
+
+func (this *LRUCache) removeTail() *DLinkedNode {
+	node := this.tail.prev
+	this.removeNode(node)
+	return node
 }

leetcode/101-200/0146.LRU-Cache/Solution_test.go

@@ -2,35 +2,9 @@ package Solution
 
 import (
 	"fmt"
-	"reflect"
-	"strconv"
 	"testing"
 )
 
-func TestSolution(t *testing.T) {
-	//	测试用例
-	cases := []struct {
-		name   string
-		inputs int
-		expect bool
-	}{
-		{"TestCase", 1, true},
-		{"TestCase", 1, true},
-		{"TestCase", 1, false},
-	}
-
-	//	开始测试
-	for i, c := range cases {
-		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Constructor(c.inputs)
-			if !reflect.DeepEqual(got, c.expect) {
-				//t.Fatalf("expected: %v, but got: %v, with inputs: %v",
-				//	c.expect, got, c.inputs)
-			}
-		})
-	}
-}
-
 func TestConstructor(t *testing.T) {
 	lru := Constructor(2)
 	fmt.Println(lru.Get(2))
@@ -40,19 +14,8 @@ func TestConstructor(t *testing.T) {
 
 	lru.Put(1, 5)
 	lru.Put(1, 2)
-	lru.Print()
 
 	fmt.Println(lru.Get(1))
 	fmt.Println(lru.Get(2))
 
 }
-
-//	压力测试
-func BenchmarkSolution(b *testing.B) {
-
-}
-
-//	使用案列
-func ExampleSolution() {
-
-}