2.1 Class-1.pptVIP

* - 30 Sample Application – A Stack Class 0 1 2 3 4 push(9) 9 push(8) push(3) 8 3 push(5) top = 2 * - 30 Sample Application – A Stack Class 0 1 2 3 4 push(9) 9 push(8) push(3) 8 3 push(5) 5 top = 3 pop( ) * - 30 Sample Application – A Stack Class 0 1 2 3 4 push(9) 9 push(8) push(3) 8 3 push(5) top = 2 pop( ) // 5被弹出 pop( ) * - 30 Sample Application – A Stack Class 0 1 2 3 4 push(9) 9 push(8) push(3) 8 push(5) top = 1 pop( ) // 3被弹出 pop( ) // 5被弹出 * - 30 Sample Application – A Stack Class What is a Stack? 栈中的元素遵循后进先出（LIFO）的原则。 Class Interface of the Class Stack: init( ): initializes the private number push(int): inserts a new integer at the top pop( ): removes the integer at the top isFull( ): checks whether a Stack is full isEmpty( ): checks whether a Stack empty dump( ): prints the Stack’s contents * - 30 Sample Application – A Stack Class Private members of Stack: top: an index arr: elements in stack dummy_val: used in member function pop errMsg( ): print an error message to standard output. * - 30 Sample Application – A Stack Class class Stack { //…… void push(int n) { if ( isFull() ) { errMsg(Full stack. Cannot push.); return; } arr[++top] = n; } }; class Stack { //…… int pop( ) { if ( isEmpty() ) { errMsg(Empty stack. Cannot pop.); return dummy_val; } return arr[top--]; } }; * - 30 Sample Application – A Stack Class class Stack { public: enum { MaxStack = 5 }; //…… }; int main( ) { //…… for( unsigned i = 0; i Stack::MaxStack; i++ ) s1.push( 1 ); //…… } * - 30 After-class Programming 编写3个函数，分别完成以下功能： 从键盘接收5个学生的数据，这些数据包括：学号、姓名以及3门课程的成绩； 计算每个学生3门课程的平均成绩； 将每个学生的信息按照学号、姓名、3门课程的成绩、平均成绩的顺序，输出到屏幕。 * * * SEI SEI PowerPoint Presentation for LiuHui, Object-Oriented Programming for C++, 2nd Edition Copyright 2007 ? SEI, All rights reserved. SEI SEI SEI SEI SEI SEI SEI SEI SEI SEI PowerPoint Presentation for LiuHui, Object-Oriented Programming for C++, 2nd Edition Copyright 2007 ?