LeetCode-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:

1. Integer (one round's score): Directly represents the number of points you get in this round.
2. "+" (one round's score): Represents that the points you get in this round are the sum of the last two valid round's points.
3. "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.
4. "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.

题目：棒球比赛，给定一个vector<string>，求最后的总得分。其中，整数代表得分，“+”代表次轮得分是前两轮之和，“D”带边次轮得分是上一轮的两倍，“C”的代表上一轮得分无效。

思路：栈的基本题目，对于输入的四种情况：若是整数，则入栈；若是“+”，则将最上边两个分数先取出加和在入栈还原，并将加和入栈；若是“D”，则入栈栈顶的两倍；若是“C”，则出栈。

代码：

class Solution {
public:
    int calPoints(vector<string>& ops) {
        stack<int> record;
        int score=0;//总分初始化为0
        int size = ops.size();
        for(int i=0;i<size;i++){
        	if(ops[i]=="C"){//不能写作'C'
        		record.pop();
			}
			else if(ops[i]=="D"){
				int temp = record.top();
				record.push(2*temp);
			}
			else if(ops[i]=="+"){
				int a = record.top();
				record.pop();
				int b = record.top();
				record.pop();
				record.push(b);//出栈之后入栈还原前两轮分数
				record.push(a);
				record.push(a+b);
			}
			else{
				record.push(stoi(ops[i]));
			}
		}
		while(!record.empty()){//所有轮求和
			score+=record.top();
			record.pop();
		}
    }
};

说明:实现中将string转int用到stoi()函数，这是C++11标准里面的，可能你的编译器报错“[Error] 'stoi' was not declared in this scope”，但是LeetCode上提交是可以的。

AC，beats 97%。