链表的 压栈，弹栈，大小 和 None与否 python

class prin: #定义一个输出函数

    def __init__(self,head):
        self.head =head
        self.next= None
    def __repr__(self):
        return f"{self.head}"
        
class zhan:定义链表的压栈，弹栈，大小是否为空
    def __init__(self):
        self.head = None
        self.size = 0
    def yazhan(self,x):
        shu = prin(x)
        if self.head is not None :
            shu.next = self.head
            self.head = shu
        else:
            self.head = shu
        self.size+=1
    def tanzhan(self):
        if self.head is  None :
            print("空")
        else:
            self.head= self.head.next
        self.size -= 1
    def is_empty(self):
        return self.head is None
    def size1(self):
        return self.size

    def __repr__(self):
        w = self.head
        s = ""
        while w :
            s += f"{w}-->"
            w=w.next
        return s + "End"
        
if __name__ == '__main__':#主函数 输出
    s = zhan()
    for i in range(10):
        s.yazhan(i)
    print(s)
    for i in range(5):
        s.tanzhan()
    print(s)
    print(s.is_empty())
    print(s.size1())