说明ch02栈简介定义.pdfVIP

Content Points ❑ Stack Specifications ❑ Implementation of Stacks ❑ Application: A Desk Calculator ❑ Application: Bracket Matching ❑ Data Types and Their Implementations Stack Specification （栈的定义） ❑ Problem Read an integer n ,which will be at most 25,then read a list of n numbers,and print the list in reverse order. Solution1: use a array. occu part of an array of fixed size ,with some of the entries in the array remaining unused. Solution2: use a stack Stack Specifications ❑ Specifications （定义） A stack is a data structure in which all insertions and deletions of entries are made at one end, called the top of the stack （栈顶）. The last entry which is inserted is the first hat will be removed. （后进先出） Example: tes sitting on the counter in a busy cafeteria. Customers take trays off the top of stack. employees returned trays back on top of the stack. Other examples… Pop （出栈） Push （入栈） Last in,first out LIFO Pushing and pop a stack Pushing and pop a stack Standard Tem ibrary (STL) ❑The standard tem ibrary (abbreviated STL) ++ contains much useful information, many functions, and many classes. ❑ The STL provides convenient implementations for many common data structures （公用数据结构）, luding almost all the data structures we shall study in this book. ❑ We can lude the STL stack implementation into our programs with the directive # lude stack and then we can define initially empty stack objects and apply methods called push, pop, top, and empty. Standard Tem i