void ExpIsCorrect(char exp[l, int n) //判断有n个字符的字符串exp左右括号是否配对正确 I SeqStack my Stack; int i, char c StackInitiate(&my Stack) for(i=0; i<n; i++) Hif((exp[i]=='(')I(exp[i]=='[')(exp[i] t')) StackPush(&myStack, exp[]) else if(expli]==')'&& StackNotEmpty(my Stack & StackTop(myStack, &c)&&c () StackPop(&my Stack, &c)2 void ExpIsCorrect(char exp[], int n) //判断有n个字符的字符串exp左右括号是否配对正确 { SeqStack myStack; int i; char c; StackInitiate(&myStack); for(i=0;i<n;i++) {if((exp[i]=='(')||(exp[i]== '[')||(exp[i]== '{')) StackPush(&myStack, exp[i]); else if(exp[i] == ')' && StackNotEmpty(myStack) && StackTop(myStack, &c) && c == '(') StackPop(&myStack, &c);