Python 实现栈

#coding=utf-8
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 Full(st):
        if st.top==st.size:
            return True
        else:
           return  False
    def Empty(st):
         if st.top==-1:
            print "Stack if Empty!"
    def pop(st):
        if st.Empty():
             print "Stack is Empty!"
        else:
             st.stack.pop(content)
             st.top=st.top-1


Q=Stack(7)
print Q.Empty()
Q.push("hello")
Q.push(5)
Q.push(4)
Q.push(3)
Q.push(2)
Q.push(1)
#print Q.Empty()

Python实现 栈操作