力扣682.棒球比赛
数组模拟栈记录分数
class Solution { public: int calPoints(vector<string>& ops) { int res=0; vector<int> points; for(auto &op:ops) { int n = points.size(); char c = op[0]; if(c == '+') { res += points[n-1] + points[n-2]; points.push_back(points[n-1]+points[n-2]); } else if(c == 'D') { res += points[n-1]*2; points.push_back(points[n-1]*2); } else if(c == 'C') { res -= points[n-1]; points.pop_back(); } else { res += stoi(op); points.push_back(stoi(op)); } } return res; } };