题意:有一串字符串,每个字符代表一个矩阵,根据括号优先级判断矩阵能否相乘;
解题思路:当遇到‘)’时表示前两矩阵需相乘,再将结果存入,可用栈模拟,先弹出两个数据,再压入所得结果;//UVa442(栈的应用)
#include<cstdio>
#include<iostream>
#include<stack>
#include<string>
using namespace std;
struct Matrix{
int a, b;
Matrix(int a=0,int b=0) :a(a),b(b) {
}
} m[26];
stack <Matrix> s;
int main(){
int n;
cin >>n;
for(int i = 0; i < n; i++){
string name;
cin >>name;
int k = name[0] - 'A';
cin >> m[k].a >> m[k].b;
}
string expr;
while(cin >> expr){
int len = expr.length();
bool error = false ;
int ans = 0;
for(int i = 0; i < len; i++){
if(isalpha(expr[i])) s.push(m[expr[i]-'A']);
else if( expr[i] == ')' ){
Matrix m2 = s.top(); s.pop();
Matrix m1 = s.top(); s.pop();
if(m1.b != m2.a) {
error = true;
break;
}
ans += m1.a*m1.b*m2.b;
s.push(Matrix(m1.a,m2.b));
}
}
if(error) printf("error\n");
else printf("%d\n",ans);
}
return 0;
}