python中栈的线性表的实现

# 基于顺序表技术实现栈类
class SStack:
    def __init__(self):
        self._elems = []

    def is_empty(self):
        return self._elems == []

    def top(self):
        '''
        取得栈中最后压入的元素，不删除
        :return:
        '''
        if self.is_empty():
            print('栈为空')
            return
        return self._elems[-1]

    def push(self, element):
        '''
        将元素压入栈
        :param element:
        :return:
        '''
        self._elems.append(element)

    def pop1(self):
        '''
        删除栈中最后压入的元素
        :return:
        '''
        if self.is_empty():
            print('栈为空')
            return
        return self._elems.pop()


if __name__ == "__main__":
    test = SStack()
    test.push(1)
    test.push(2)
    print(test.is_empty())
    print (test.top())
    test.pop1()
    print(test.top())
    test.pop1()
    print(test.top())