zoukankan      html  css  js  c++  java
  • Stack-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.
    class Solution {  
    public:  
        int getNum(string& s) {  
            int num;  
            stringstream ss;  
            ss << s;  
            ss >> num;  
            return num;  
        }  
        int calPoints(vector<string>& ops) {  
            int sum = 0;  
            vector<int> round;  
            for (int i = 0; i < ops.size(); i++) {  
                if (ops[i] == "C") {  
                    sum -= round.back();  
                    round.pop_back();  
                } else if (ops[i] == "D") {  
                    int temp = 2 * round.back();  
                    round.push_back(temp);  
                    sum += temp;  
                } else if (ops[i] == "+") {  
                    int index = round.size() - 1;  
                    int temp = round[index] + round[index-1];  
                    round.push_back(temp);  
                    sum += temp;  
                } else {  
                    int temp = getNum(ops[i]);  
                    sum += temp;  
                    round.push_back(temp);  
                }  
            }  
            return sum;  
        }  
    };  
  • 相关阅读:
    [转]Ubuntu Tweak 0.8.7 发布:支持 Ubuntu 14.04
    冷知识 —— 地名的解释
    冷知识 —— 地名的解释
    冷知识 —— 国家域名、国际电话区号列表
    冷知识 —— 国家域名、国际电话区号列表
    基于梯度的权重更新优化迭代算法
    基于梯度的权重更新优化迭代算法
    中英文对照 —— 图表等的可视化
    中英文对照 —— 图表等的可视化
    matplotlib plot 绘图函数发生阻塞(block)时的解决方法
  • 原文地址:https://www.cnblogs.com/msymm/p/8278224.html
Copyright © 2011-2022 走看看