Java编程与算法实用入门AConciseandPracticalIntroduction-LIX.PDFVIP

Java 编程与算法实用入门 A Concise and Practical Introduction to Programming Algorithms in Java • Chapter 8: Data-structures and object methods • 第 8 章：数据结构和对象的方法 1 Agenda 大纲 • FIFO data-structures 先进先出（ FIFO) 数据 结构 • (= First In First Out) • ● Heap data-structures 堆结构 • ● Non-static methods 非静态方法 • (= object methods) （= 对象的方法 • ● Revisiting lists (OO-style) 重访问链表（面 向对象的类型 2 FIFOs: Mastering queues 先进先出 : 控制队列 ● Objects are considered in turn, one by one 对象轮流一个 一个处理 ● Process each object according to their arrival time 根据对 象的到达时间来进行处理 ● While objects are processed, others are queued 当有对象 被处理时，其它对象排队等待 ● First object should be first served! 第一个到达的对象被第 一个处理 Basic examples: 简单的几个例子： ● Waiting in a queue at the post office. 在邮局排队 ● Printing ?jobs on a printer. 有多个文件同时需要打印机打 印 FIFO = First In First Out ! FIFO = 先进先出！ 3 A basic solution 基本思路 ● Stack objects in an array as soon as they arrive 一收到对象就把它存在 栈中 ● To stack an incoming object, should know the index of the last location 要把对象存在栈中，就需要知道存储的位置（索引 ● Should also know the index of the last processed object (so that we can process the next one) While processing an object, others can come in the array (= queued) 同时还需要知道上一个处理的对象的索引（这样才能知道下一个对象是