682. 棒球比赛
模拟栈,so easy 对叭
class Solution {
public:
int tt = 0;
int s[1010] = {0};
int calPoints(vector<string>& ops) {
for (auto& c : ops) {
if (c == "+") {
s[tt + 1] = s[tt] + s[tt - 1];
tt ++ ;
}
else if (c == "D") {
s[tt + 1] = s[tt] * 2;
tt ++ ;
}
else if (c == "C") {
tt -- ;
}
else s[ ++ tt] = stoi(c);
}
int res = 0;
for (int i = 1; i <= tt; i ++ ) {
res += s[i];
}
return res;
}
};