数据结构与算法3.1.pptVIP

Chapter 3.1;3.3 The Stack ADT; Stack Model;Stack Model; Stack Model;3.3.2. Implementation of Stack;Linked List Implementation of Stacks;Linked List Implementation of Stacks;Linked List Implementation of Stacks; 3.3.2. Implementation of Stack;Array Implementation of Stacks;Array Implementation of Stacks;Array Implementation of Stacks;Array Implementation of Stacks;Array Implementation of Stacks;Array Implementation of Stacks;3.3.3.Applications;Parenthesis Matching (a*(b+c)+d) (a+b))( 1 2 3 4 5 6 7 8 9 10 11 121314 151617 181920212223 ( d + ( a + b ) * c * ( d + e ) – f ) ) ( ( ) 4 8 12 16 1 19 20 位置不匹配 22 23 21 位置不匹配 ;#include iostream.h #include string.h #include stdio.h #include “stack.h” const int Maxlength = 100; // max expression length void PrintMatchedPairs(char *expr) { Stackint s(Maxlength); int j, length = strlen(expr); for ( int i = l; i = length; i++) { if ( expr[i-1]= =‘(‘) s.Add(i); else if (expr[i-1]= =‘)’) try {s.Delete(j); cout j‘ ‘ i endl;} catch (OutOfBounds) {cout “No match for right parenthesis” “ at “ i endl;} } while ( !s.IsEmpty ()) { s.Delete(j); cout “No match for left parenthesis at “ j endl; }} ; void static main(void) { char expr[MaxLength]; cout “type an expression of length at most” MaxLengthendl; cin.getline(expr, MaxLength); cout“the pairs of matching parentheses in “ endl; puts(expr); cout“are”endl; printMatcnedPairs(expr); } O(n) ;2.Expression Evaluation compiler: infix Expression postfix Expression postfix Expression Evaluat