LeetCode 682. Baseball Game

最新推荐文章于 2022-04-10 21:36:58 发布

weixin_30647065

最新推荐文章于 2022-04-10 21:36:58 发布

阅读量66

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/A-Little-Nut/p/10080068.html

本文介绍了一种处理棒球比赛计分的算法，通过解析一系列操作字符串来计算总得分。算法支持直接得分、加号操作（两轮得分之和）、D操作（上一轮得分的两倍）和C操作（取消上一轮得分）。文章提供了具体实例，展示了如何使用该算法进行计算。

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.

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

转载于:https://www.cnblogs.com/A-Little-Nut/p/10080068.html