面向对象编程面向对象
2大纲什么是面向对象为什么面向对象
Queue(FIFO)First-In,First-OutFirst-Come,First-Serve4321FrontBack8Put(Enqueue)Get(Dequeue)queue.put(8)item=queue.get()
Stack(FILO)First-In,Last-OutPushPop1238Topstack.push(8)item=stack.pop()
2→Top……5+(3+2*/+1)325+(3+2*/+13*++/+OUTPUT:Ifthecurrentinputtokenisan?operand,appendittotheoutputstringIfthecurrentinputtokenisan?operator,popoffalloperatorsthathave?equalorhigherprecedence?andappendthemtotheoutputstring;pushtheoperatorontothestackIfthecurrentinputtokenis?(,pushitontothestackIfthecurrentinpu
原创力文档

文档评论(0)