[Go版]算法通关村第四关青铜——如何基于数组和链表实现栈

栈的特点

特点：先入后出，后入先出
应用：函数内部定义的变量一般都放在栈上

基于数组实现栈

源码地址： GitHub-golang版本

func NewStack1[T any](maxNum int) *Stack1[T]{
	slice := make([]T, maxNum)
	return &Stack1[T]{
		MaxNum:maxNum,
		Array:slice,
		Top:0,
	}
}

type Stack1[T any] struct {
	MaxNum int
	Array []T
	Top int	//栈顶上的位置
}

func (this *Stack1[T]) Push(val T) error {
	if this.IsFull() {
		this.ExpandCap(this.MaxNum)
	}
	this.Array[this.Top] = val
	this.Top++
	return nil
}

func (this *Stack1[T]) Pop() (val T, err error) {
	val, err = this.Peek()
	if err == nil {
		this.Top--
	}
	return val, err
}

func (this *Stack1[T]) Peek() (val T, err error) {
	if this.IsEmpty() {
		return val, errors.New("stack empty")
	}
	return this.Array[this.Top-1], nil
}

func (this *Stack1[T]) IsFull() bool {
	return this.MaxNum == this.Top
}

func (this *Stack1[T]) IsEmpty() bool {
	return this.Top == 0
}

func (this *Stack1[T]) ExpandCap(size int) {
	tmpArray := make([]T, this.MaxNum+size)
	this.Array = append(this.Array, tmpArray ...)
	this.MaxNum = this.MaxNum+size
}

基于链表实现栈

源码地址： GitHub-golang版本

func NewStack2[T any]() *Stack2[T] {
	return &Stack2[T]{}
}

type LinkNode[T any] struct {
	Val T 
	Next *LinkNode[T]
}
type Stack2[T any] struct {
	Head *LinkNode[T]
}

func (this *Stack2[T]) Push(val T) error {
	if this.IsEmpty() {
		this.Head = &LinkNode[T]{
			Val:val,
		}
		return nil
	}
	newNode := &LinkNode[T]{
		Val:val,
		Next:this.Head,
	}
	this.Head = newNode
	return nil
}

func (this *Stack2[T]) Pop() (val T, err error) {
	val, err = this.Peek()
	if err == nil {
		this.Head = this.Head.Next
	}
	return val, err
}

func (this *Stack2[T]) Peek() (val T, err error) {
	if this.IsEmpty() {
		return val, errors.New("stack empty")
	}
	return this.Head.Val, nil
}

func (this *Stack2[T]) IsEmpty() bool {
	return this.Head == nil
}