Stack implementation, into the stack to determine whether full, the stack to determine whether empty

#栈的实现, the stack to determine whether the full, the stack to determine whether empty

Class Stack ():

def __init__ (st,size):

St.stack=[];

St.size=size;

St.top=-1;

def push (st,content):

If St. Full ():

Print "Stack is full!"

Else

St.stack.append (content)

St.top=st.top+1

def out (ST):

If St. Empty ():

Print "Stack is empty!"

Else

St.top=st.top-1

def full (ST):

If st.top==st.size:

Return Ture

Else

Return False

def Empty (ST):

If St.top==-1:

Print "Stack is empty!"

Example:

>>>q=stack (7) #初始化栈的容量为7, and assign to Q

>>>q.empty () #检查栈是否为空

Ture

>>>q.push ("Hello") #进栈, push "Hello" inside the stack

>>>q.empty () #检查栈是否为空

Flase

>>>q.out #出栈

This article from "Life is too short, I use Python" blog, reprint please contact the author!

Stack implementation, into the stack to determine whether full, the stack to determine whether empty