mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 23:06:31 +08:00
130 lines
2.7 KiB
Go
130 lines
2.7 KiB
Go
// File: stack_test.go
|
|
// Created Time: 2022-11-28
|
|
// Author: Reanon (793584285@qq.com)
|
|
|
|
package chapter_stack_and_queue
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
|
|
. "github.com/krahets/hello-algo/pkg"
|
|
)
|
|
|
|
func TestStack(t *testing.T) {
|
|
/* 初始化栈 */
|
|
// 在 Go 中，推荐将 Slice 当作栈来使用
|
|
var stack []int
|
|
|
|
/* 元素入栈 */
|
|
stack = append(stack, 1)
|
|
stack = append(stack, 3)
|
|
stack = append(stack, 2)
|
|
stack = append(stack, 5)
|
|
stack = append(stack, 4)
|
|
fmt.Print("栈 = ")
|
|
PrintSlice(stack)
|
|
|
|
/* 访问栈顶元素 */
|
|
peek := stack[len(stack)-1]
|
|
fmt.Println("栈顶元素 peek =", peek)
|
|
|
|
/* 元素出栈 */
|
|
pop := stack[len(stack)-1]
|
|
stack = stack[:len(stack)-1]
|
|
fmt.Print("出栈元素 pop = ", pop, "，出栈后 stack = ")
|
|
PrintSlice(stack)
|
|
|
|
/* 获取栈的长度 */
|
|
size := len(stack)
|
|
fmt.Println("栈的长度 size =", size)
|
|
|
|
/* 判断是否为空 */
|
|
isEmpty := len(stack) == 0
|
|
fmt.Println("栈是否为空 =", isEmpty)
|
|
}
|
|
|
|
func TestArrayStack(t *testing.T) {
|
|
// 初始化栈, 使用接口承接
|
|
stack := newArrayStack()
|
|
|
|
// 元素入栈
|
|
stack.push(1)
|
|
stack.push(3)
|
|
stack.push(2)
|
|
stack.push(5)
|
|
stack.push(4)
|
|
fmt.Print("栈 stack = ")
|
|
PrintSlice(stack.toSlice())
|
|
|
|
// 访问栈顶元素
|
|
peek := stack.peek()
|
|
fmt.Println("栈顶元素 peek =", peek)
|
|
|
|
// 元素出栈
|
|
pop := stack.pop()
|
|
fmt.Print("出栈元素 pop = ", pop, ", 出栈后 stack = ")
|
|
PrintSlice(stack.toSlice())
|
|
|
|
// 获取栈的长度
|
|
size := stack.size()
|
|
fmt.Println("栈的长度 size =", size)
|
|
|
|
// 判断是否为空
|
|
isEmpty := stack.isEmpty()
|
|
fmt.Println("栈是否为空 =", isEmpty)
|
|
}
|
|
|
|
func TestLinkedListStack(t *testing.T) {
|
|
// 初始化栈
|
|
stack := newLinkedListStack()
|
|
// 元素入栈
|
|
stack.push(1)
|
|
stack.push(3)
|
|
stack.push(2)
|
|
stack.push(5)
|
|
stack.push(4)
|
|
fmt.Print("栈 stack = ")
|
|
PrintList(stack.toList())
|
|
|
|
// 访问栈顶元素
|
|
peek := stack.peek()
|
|
fmt.Println("栈顶元素 peek =", peek)
|
|
|
|
// 元素出栈
|
|
pop := stack.pop()
|
|
fmt.Print("出栈元素 pop = ", pop, ", 出栈后 stack = ")
|
|
PrintList(stack.toList())
|
|
|
|
// 获取栈的长度
|
|
size := stack.size()
|
|
fmt.Println("栈的长度 size =", size)
|
|
|
|
// 判断是否为空
|
|
isEmpty := stack.isEmpty()
|
|
fmt.Println("栈是否为空 =", isEmpty)
|
|
}
|
|
|
|
// BenchmarkArrayStack 8 ns/op in Mac M1 Pro
|
|
func BenchmarkArrayStack(b *testing.B) {
|
|
stack := newArrayStack()
|
|
// use b.N for looping
|
|
for i := 0; i < b.N; i++ {
|
|
stack.push(777)
|
|
}
|
|
for i := 0; i < b.N; i++ {
|
|
stack.pop()
|
|
}
|
|
}
|
|
|
|
// BenchmarkLinkedListStack 65.02 ns/op in Mac M1 Pro
|
|
func BenchmarkLinkedListStack(b *testing.B) {
|
|
stack := newLinkedListStack()
|
|
// use b.N for looping
|
|
for i := 0; i < b.N; i++ {
|
|
stack.push(777)
|
|
}
|
|
for i := 0; i < b.N; i++ {
|
|
stack.pop()
|
|
}
|
|
}
|