链栈 linkstack

class Node: # 初始化一个链表
    def __init__(self,data,next = None):
        self.data = data
        self.next = next

    def __repr__(self):
        return f"Node({self.data})" # 输出的格式

class LinkStack:
    def __init__(self):
        self.top = None
        self.size = 0 # 统计元素的个数

    def ssize(self):
        return self.size

    def push(self,x): # 添加 压栈
        node = Node(x)
        self.size += 1
        if self.top is None:
            self.top = node
        else:
            node.next = self.top
            self.top = node


    def pop(self): # 删除 出栈
        self.size -= 1
        if self.top is None:
            raise IndexError('pop from empty stack')
        else:
            node = self.top
            self.top = node.next
            return node.data

    def empty(self): # 判断是否为空
        return self.top is None

    def __repr__(self): # 输出格式
        cur = self.top
        string_re = ''
        while cur:
            string_re += f"{cur} ->"
            cur = cur.next
        return string_re + 'END'
if __name__ == '__main__':
    stack = LinkStack()
    for i in range(5):
        stack.push(i)
    print(stack)
    print(stack.ssize())
    stack.pop()
    print(stack)
    print(stack.ssize())
    print(stack.empty())

输出结果

> Node(4) ->Node(3) ->Node(2) ->Node(1) ->Node(0) ->END 
> 5 
> Node(3)->Node(2) ->Node(1) ->Node(0) ->END 
> 4 
> False