堆栈的应用(1) 平衡符号 C++实现

1 #include <stdio.h>  
2 #include  <stdlib.h>  
3 #include  <stack>  
4 #include  <string>  
5 #include  <iostream>  
6 **using**  **namespace**  std;  
7   
8 **bool**  CheckStack(**const**  **char**  ac,  stack<**char** >& acSta)  
9 {  
10     **if**(ac == '(' ||  ac == '[')  
11     {  
12         acSta.push(ac);  
13     }  
14     **else**  **if**(ac  == ')')  
15     {  
16         **if**( acSta.empty() || acSta.top() != '(' )  
17         {  
18             **return**  false;  
19         }  
20         acSta.pop();  
21     }  
22     **else**  **if**(  
ac == ']')  
23     {  
24         **if**(acSta.empty() || acSta.top() != '[' )  
25         {  
26             **return**  false;  
27         }  
28         acSta.pop();  
29     }  
30   
31     **return**  true;  
32 }  
33   
34 **void**  DumpStack(stack<**char** >& acSta)  
35 {  
36     **if**(!acSta.empty())  
37     {  
38         cout  <<"stack: ";  
39         **while**(!acSta.empty())  
40         {  
41             cout  <<acSta.top() <<" ";  
42             acSta.pop();  
43         }  
44         cout  <<endl;  
45     }  
46 }  
47   
48 **int**  main(**int**  argc, **char** *  argv[])  
49 {  
50     **char**  lc;  
51     stack<**char** > lcSta;  
52     **while**(cin >> lc)  
53     {  
54         **if**(!CheckStack(lc, lcSta))  
55         {  
56             cout  <<"Error happen: " <<lc  <<endl;  
57             DumpStack(lcSta);  
58             exit(1);  
59         }  
60     }  
61   
62     DumpStack(lcSta);  
63   
64     exit(0);  
65 }  
66