leetcode---C++实现---682. Baseball Game（棒球比赛）

题目

You’re now a baseball game point recorder.
Given a list of strings, each string can be one of the 4 following types:

• Integer (one round’s score): Directly represents the number of points you get in this round.
• “+” (one round’s score): Represents that the points you get in this round are the sum of the last two valid round’s points.
• “D” (one round’s score): Represents that the points you get in this round are the doubled data of the last valid round’s points.
• “C” (an operation, which isn’t a round’s score): Represents the last valid round’s points you get were invalid and should be removed.

Each round’s operation is permanent and could have an impact on the round before and the round after.
You need to return the sum of the points you could get in all the rounds.

Example 1:

Input: [“5”,“2”,“C”,“D”,"+"]
Output: 30
Explanation:
Round 1: You could get 5 points. The sum is: 5.
Round 2: You could get 2 points. The sum is: 7.
Operation 1: The round 2’s data was invalid. The sum is: 5.
Round 3: You could get 10 points (the round 2’s data has been removed). The sum is: 15.
Round 4: You could get 5 + 10 = 15 points. The sum is: 30.

Example 2:

Input: [“5”,"-2",“4”,“C”,“D”,“9”,"+","+"]
Output: 27
Explanation:
Round 1: You could get 5 points. The sum is: 5.
Round 2: You could get -2 points. The sum is: 3.
Round 3: You could get 4 points. The sum is: 7.
Operation 1: The round 3’s data is invalid. The sum is: 3.
Round 4: You could get -4 points (the round 3’s data has been removed). The sum is: -1.
Round 5: You could get 9 points. The sum is: 8.
Round 6: You could get -4 + 9 = 5 points. The sum is 13.
Round 7: You could get 9 + 5 = 14 points. The sum is 27.

Note:

• The size of the input list will be between 1 and 1000.
• Every integer represented in the list will be between -30000 and 30000.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/baseball-game

题解思路

使用栈作为辅助；

1. 遍历vector；
2. 遇到数字时将数据压入栈；
3. 遇到"C"时说明栈顶元素无效，将栈顶元素弹出；
4. 遇到"D"时，说明当前分数为栈顶元素的两倍，将栈顶元素两倍的值压入栈中即可；
5. 遇到"+"时，说明当前分数为栈顶元素和次栈顶元素的和，计算后将数据压栈；
6. 所有元素处理完毕后，将栈中所有元素相加即为最终分数。

算法实现（C++）

class Solution {
public:
    int calPoints(vector<string>& ops) {
        stack<int> numStack;
        int opsSize = ops.size();
        for (int i = 0; i < opsSize; ++i)
        {
            string s = ops[i];
            if (s == "C")
                numStack.pop();
            else if (s == "D")
                numStack.push(2 * numStack.top());
            else if (s == "+")
            {
                int pre1 = numStack.top();
                numStack.pop();
                int pre2 = numStack.top();
                numStack.push(pre1);
                numStack.push(pre1 + pre2);
            }
            else
                numStack.push(atoi(s.c_str())); 
        }

        int ret = 0;
        while (!numStack.empty())
        {
            ret += numStack.top();
            numStack.pop();
        }
        return ret;    
    }
};