Add solution and test-cases for problem 155

Author: Cori1109

leetcode/101-200/0155.Min-Stack/Solution.go

@@ -1,5 +1,81 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+const (
+	push   = "push"
+	pop    = "pop"
+	top    = "top"
+	getMin = "getMIn"
+)
+
+type MinStack struct {
+	data, min []int
+}
+
+func Constructor4() MinStack {
+	return MinStack{
+		data: make([]int, 0),
+		min:  make([]int, 0),
+	}
+}
+
+func (this *MinStack) Push(val int) {
+	if len(this.data) == 0 {
+		this.data = append(this.data, val)
+		this.min = append(this.min, val)
+		return
+	}
+
+	top := this.min[len(this.min)-1]
+	this.data = append(this.data, val)
+	if top > val {
+		top = val
+	}
+
+	this.min = append(this.min, top)
+}
+
+func (this *MinStack) Pop() {
+	if len(this.data) > 0 {
+		l := len(this.data)
+		this.data = this.data[:l-1]
+		this.min = this.min[:l-1]
+	}
+}
+
+func (this *MinStack) Top() int {
+	if len(this.data) > 0 {
+		return this.data[len(this.data)-1]
+	}
+
+	return -1
+}
+
+func (this *MinStack) GetMin() int {
+	return this.min[len(this.min)-1]
+}
+
+// action, push, pop, top, getMin
+func Solution(actions []string, vals []int) []int {
+	o := Constructor4()
+	expect := make([]int, 0)
+	for idx, act := range actions {
+		if act == push {
+			o.Push(vals[idx])
+			continue
+		}
+		if act == pop {
+			o.Pop()
+			continue
+		}
+
+		if act == top {
+			top := o.Top()
+			expect = append(expect, top)
+			continue
+		}
+
+		m := o.GetMin()
+		expect = append(expect, m)
+	}
+	return expect
 }

leetcode/101-200/0155.Min-Stack/Solution_test.go

@@ -9,22 +9,22 @@ import (
 func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
-		name   string
-		inputs bool
-		expect bool
+		name    string
+		actions []string
+		inputs  []int
+		expect  []int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", []string{push, push, push, getMin, pop, top, getMin}, []int{-2, 0, -3, 0, 0, 0, 0}, []int{-3, 0, -2}},
+		{"TestCase2", []string{push, push, getMin, top, pop, push, getMin, top}, []int{1, 2, 0, 0, 0, -2, 0, 0}, []int{1, 2, -2, -2}},
 	}
 
 	//	开始测试
 	for i, c := range cases {
 		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Solution(c.inputs)
+			got := Solution(c.actions, c.inputs)
 			if !reflect.DeepEqual(got, c.expect) {
-				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
-					c.expect, got, c.inputs)
+				t.Fatalf("expected: %v, but got: %v, with input-actions: %v, input-inputs: %v",
+					c.expect, got, c.actions, c.inputs)
 			}
 		})
 	}