python 使用列表实现栈数据结构

class Stack(object):

    def __init__(self):
        self.items = []

    def push(self, item):
        self.items.append(item)

    def pop(self):
        try:
            return self.items.pop()
        except:
            return '栈内无任何元素'

    def peek(self):
        try:
            return self.items[-1]
        except:
            return '栈内无任何元素'

    def is_empty(self):
        return not bool(self.items)

    def size(self):
        return len(self.items)

    def __str__(self):
        return str(self.items)

    def __repr__(self):
        return str(self.items)


if __name__ == '__main__':
    print('----stack.py----')