数据结构 第三章 栈和队列

练习2：

洛谷 P1739 表达式括号匹配：

#include<bits/stdc++.h>
using namespace std;
stack<char>s;
int main()
{
   
 char ch;
 int flags = 1;//1正确，0错误
 while (cin >> ch && ch != '@') {
   
  if (ch == '{' || ch == '[' || ch == '(')
   s.push(ch);
  else {
   
   if (ch == '}' && s.top() != '{')flags = 0;
   else if (ch == ']' && s.top() != '[')flags = 0;
   else if (ch == ')' && s.top() != '(')flags = 0;
  }
 }
 if (!s.empty())flags = 0;//如果栈不为空，则还有括号无法匹配
 if (flags == 1) cout << "YES";
 else cout << "NO";
 return 0;
}

练习3

#include<bits/stdc++.h>
using namespace std;
stack<double>OPND;//STL数字栈
stack<char>OPTR;//符号栈
int OPTR_VALUE[1000];
void setup() {
   
 OPTR_VALUE['#'] = 1;
 OPTR_VALUE['+'] = 2;
 OPTR_VALUE['-'] = 2;
 OPTR_VALUE['*'] = 3;
 OPTR_VALUE['/'] = 3;
 OPTR_VALUE['^'] = 4;
}
double Operate(double a, char c, double b) {
   
 switch (c)
 {
   
 case'+':return a + b;
 case'-':return  a - b;
 case'*':return  a * b;
 case'/':return  a / b;
 case'^':return pow(a, b);
 default:break;
 }