文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

Baseball Game

2. Solution

class Solution {
public:
    int calPoints(vector<string>& ops) {
        int score = 0;
        int sum = 0;
        vector<int> scores;
        for(int i = 0; i < ops.size(); i++) {
            if(ops[i] == "C") {
                sum -= scores.back();
                scores.pop_back();
            }
            else if (ops[i] == "D") {
                score = 2 * scores.back();
                sum += score;
                scores.push_back(score);
            }
            else if ((ops[i] == "+")) {
                score = scores.back() + scores[scores.size() - 2];
                sum += score;
                scores.push_back(score);
            }
            else {
                score = stoi(ops[i]);
                sum += score;
                scores.push_back(score);
            }
        }
        return sum;
    }
};

Reference

1. https://leetcode.com/problems/baseball-game/description/