栈的定义
栈(stack)是限定在仅在表尾插入和删除的操作的线性表。
我们允许插入和删除的一端称为栈顶(top),另一端称为栈底(bottom),不含任何数据元素的栈称空栈。栈又称为后进先出(Last in First out)的线性表,简称LIFO结构。
理解栈的定义需要注意:
它是一个特殊的线性表,也就是说,栈元素具有线性关系,即前驱后继关系。只不过它是一种特殊的线性表。定义中说在线性表尾进行插入的和删除操作,这里的表尾是指栈顶,而不是栈底。
栈的插入,叫作进栈,也称压栈、入栈。
栈有删除操作,叫作出栈,也有的叫弹栈。
package main
import("fmt")/*
* 栈的抽象数据类型
* ADT statck
* Data
* 同线性表。元素具有相同的类型,相邻的元素具有前驱和后继关系
* Operation
* InitStack(*S):初始化操作,建立一个空栈。
* DestroyStack(*S): 若栈存在,则销毁它。
* ClearStack(*S): 将栈清空
* StackEmpty(*S): 若栈为空,返回true,否则返回false.
* GetTop(S,*e): 若栈存在并非空,用e返回栈顶的元素
* Push(*S,e): 若栈S存在,插入元素e到栈S中并成为栈顶
* Pop(*S,*e): 删除栈S中栈顶元素,并用e返回其值。
* StackLength(*S): 返回栈S的元素个数.
*///使用顺序存储实现的栈const MAXSIZE =5type Stack struct{
stack *[MAXSIZE]int
top int}funcInitStack(st *Stack)*Stack{
st =new(Stack)
st.stack =new([MAXSIZE]int)return st
}funcDestroyStack(st *Stack)*Stack{
fmt.Printf("%p\n",st)
st =nilreturn st
}funcClearStack(st *Stack){
st.stack =new([MAXSIZE]int)
st.top =0}funcPush(st *Stack, e int){if st.top == MAXSIZE{
fmt.Printf("stack full\n")return}
st.stack[st.top]= e
st.top++}funcPop(st *Stack, e *int){if st.top <=0{
fmt.Println("stack is empty")return}*e = st.stack[st.top-1]
st.stack[st.top-1]=0
st.top--}funcStackLength(st *Stack)int{return st.top
}funcGetTop(st *Stack, e *int){if st.top <=0{
fmt.Printf("stack is empty")return}*e = st.stack[st.top-1]}funcStackEmpty(st *Stack)bool{if st.top ==0{returntrue}returnfalse}funcmain(){var st *Stack
st =InitStack(st)//fmt.Printf("%#v\n",st)//st = DestroyStack(st)
fmt.Printf("%#v\n",st)Push(st,1)Push(st,2)Push(st,3)Push(st,4)Push(st,5)
fmt.Printf("%#v\n",st.stack)var e *int=new(int)Pop(st,e)
fmt.Printf("e:%v,length:%v, values:%v\n",*e,StackLength(st),st.stack)Pop(st,e)
fmt.Printf("e:%v,length:%v, values:%v\n",*e,StackLength(st),st.stack)Pop(st,e)
fmt.Printf("e:%v,length:%v, values:%v\n",*e,StackLength(st),st.stack)Pop(st,e)
fmt.Printf("e:%v,length:%v, values:%v\n",*e,StackLength(st),st.stack)Pop(st,e)
fmt.Printf("e:%v,length:%v, values:%v\n",*e,StackLength(st),st.stack)Pop(st,e)
fmt.Printf("e:%v,length:%v, values:%v\n",*e,StackLength(st),st.stack)
fmt.Println()for i:=10; i <15;i++{Push(st,i)}
fmt.Printf("%#v\n",st.stack)
fmt.Println()for i:=0; i <5;i++{Pop(st,e)
fmt.Printf("e:%v,length:%v, values:%v\n",*e,StackLength(st),st.stack)}
fmt.Println()Push(st,100)GetTop(st,e)
fmt.Printf("top value:%v\n",*e)//100Push(st,200)GetTop(st,e)
fmt.Printf("top value:%v\n",*e)//200
fmt.Printf("is empty stack:%v\n",StackEmpty(st))ClearStack(st)
fmt.Printf("is empty stack:%v\n",StackEmpty(st))
fmt.Printf("%#v\n",st.stack)}
stack_obj.gopackage main
import("fmt")type Stack struct{
stack []int
top int
maxsize int}funcNewStack(maxsize int)*Stack{return&Stack{
stack:make([]int,maxsize,maxsize),
top:0,
maxsize: maxsize,}}func(this *Stack)Destroy(){
this.stack =nil
this.top =0
this.maxsize =0}func(this *Stack)Push(value int)(bool,error){if this.top >= this.maxsize{returnfalse,fmt.Errorf("stack is full")}
this.stack[this.top]= value
this.top++returntrue,nil}func(this *Stack)Pop()(value int,err error){if this.top <=0{
value =-1
err = fmt.Errorf("stack is empty")return}
value = this.stack[this.top-1]
this.stack[this.top-1]=0
this.top--return}func(this *Stack)Clear()(bool,error){if this.stack ==nil{returnfalse,fmt.Errorf("stack is nil")}
this.top =0
this.stack =make([]int,this.maxsize,this.maxsize)returntrue}func(this *Stack)Emepty()bool{if this.top ==0|| this.stack ==nil{returntrue}returnfalse}func(this *Stack)Size()int{return this.top
}funcmain(){
st :=NewStack(5)
fmt.Printf("%#v, stack:%v\n",st,st.stack)//st.Destroy()//fmt.Printf("%#v\n",st)for i:=0; i <5;i++{
st.Push(i*2)}
fmt.Printf("%#v, stack:%v\n",st,st.stack)_,err := st.Push(100)
fmt.Printf("push err:%v\n",err)
fmt.Println()for i:=0; i <5;i++{
v,err := st.Pop()
fmt.Printf("v:%v,err:%v\n",v,err)}
fmt.Printf("%#v, stack:%v\n",st,st.stack)
fmt.Println()}