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 twovalid
round's points."D"
(one round's score): Represents that the points you get in this round are the doubled data of the lastvalid
round's points."C"
(an operation, which isn't a round's score): Represents the lastvalid
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.
题意:给出一个字符串,字符串中包括本轮得分或其他三种操作,计算出最终可得到的总分。其中,“+”表示当前轮次得分为前两个有效轮次得分之和,"C"表示前一有效轮次的得分变为无效,“D”表示本轮得分为前一个有效轮次的两倍。
思路:用一个动态数组,根据每轮给出的得分或操作,记录下每一轮的得分。
stoi(str)函数,可以直接将一个string转化为int。
class Solution {
public:
int calPoints(vector<string>& ops) {
int sum,a,b,tmp;
if(ops.size()==0) return 0;
else if(ops.size()==1)
return stoi(ops[0]);
else{
sum=0;
vector<int>vec;
vec.push_back(stoi(ops[0]));
sum+=stoi(ops[0]);
for(int i=1;i<ops.size();i++){
if(ops[i]=="C"){
sum-=vec.back();
vec.pop_back();
}else if(ops[i]=="D"){
sum+=vec.back()*2;
vec.push_back(vec.back()*2);
}else if(ops[i]=="+"){
tmp=vec[vec.size()-1]+vec[vec.size()-2];
sum+=(tmp);
vec.push_back(tmp);
}else{
sum+=stoi(ops[i]);
vec.push_back(stoi(ops[i]));
}
}
}
return sum;
}
};