本文探讨了数据结构中两个基本类型——栈和队列的实现与应用。通过使用单链表或可调整大小的数组，我们展示了如何构建这些数据结构。此外，引入了Java的泛型和迭代器特性，简化了客户端代码。最后，我们讨论了从解析算术表达式到模拟排队系统的各种应用场景。
Suggested Readings. Section 1.3 and 2.1 in Algorithms, 4th edition.
Lecture: Stacks and Queues. We consider two fundamental data types for storing collections of objects: the stack and the queue. We implement each using either a singly-linked list or a resizing array. We introduce two advanced Java features—generics and iterators—that simplify client code. Finally, we consider various applications of stacks and queues ranging from parsing arithmetic expressions to simulating queueing systems.
扫一扫
398
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
