利用python列表模拟堆栈

#!/usr/bin/env python 

stack  = []     #make a list

def pushit():
    stack.append(raw_input('Enter New string: ').strip())


def popit():
    if len(stack) == 0:
        print "Can not pop from an empty stack !"
    else:
        print "Removed [", `stack.pop()`, "]"

def viewstack():
    print stack

CMDs = {'u':pushit , "o":popit ,'v': viewstack}     #make a dictionary


def showmenu():
    pr = """
        p(U)sh
        p(O)p
        (V)iew
        (Q)uit

        Enter choice: """

    while True:
        while True:
            try:
                choice = raw_input(pr).strip()[0].lower()
            except(EOFError,KeyboardInterrupt,IndexError):
                choice = "q"


            print "\n You picked: [%s]" % choice
            if choice not in "uovq":
                print "Invalid option, try again"
            else:
                break
            
        if choice == "q":
            break
    
        CMDs[choice]()


if __name__ == "__main__":
    showmenu()

 

编程中的注意点：

 

s.strip()的使用默认是删除空白符   \\s代表一个字符串

__name__ == "__main__" 代表模块被执行，如果仅仅是导入 __name__的值为模块的名字

注意缩进的使用，保证代码块在正确的缩进中

 

转载于:https://www.cnblogs.com/qiaogeqaq/p/7799985.html