zoukankan      html  css  js  c++  java
  • 仿写一个类实现队列

    仿写自博客 http://www.cnblogs.com/chongyou/p/7099326.html
    class
    Node(object): def __init__(self,val): self.value = val self.next = None class myquene(object): def __init__(self): self.first = None self.last = None # self.next = None def enter(self,x): n = Node(x) if self.first ==None: self.first = n self.last = self.first else: self.last.next = n self.last = n def quit(self): if not self.first: return None else: tmp = self.first.value self.first = self.first.next return tmp def quit_all(self): retlist = [] while self.first!=None: retlist.append(self.first.value) self.first = self.first.next return retlist if __name__ =="__main__": q = myquene() q.enter('厉智') q.enter('徐晓冬') q.enter('陈培昌') q.enter('程劲') print(q.quit_all())
  • 相关阅读:
    权限和分组
    验证与授权
    CSRF、XSS、clickjacking、SQL 的攻击与防御
    上下文处理器及中间件
    类和实例
    偏函数
    生成器
    迭代 复习
    函数调用 复习
    复习 条件判断,循环
  • 原文地址:https://www.cnblogs.com/saintdingspage/p/9100447.html
Copyright © 2011-2022 走看看