zoukankan      html  css  js  c++  java
  • 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.

    解题思路:

    使用stack记录每轮得分。

    代码:

     1 class Solution {
     2 public:
     3     int calPoints(vector<string>& ops) {
     4         stack<int> nums;
     5         int sum = 0;
     6         for (auto str : ops) {
     7             if (str == "C") {
     8                 int num = nums.top();
     9                 nums.pop();
    10                 sum -= num;
    11             } else if (str == "D") {
    12                 int num = nums.top();
    13                 nums.push(2*num);
    14                 sum += 2*num;
    15             } else if (str == "+") {
    16                 int num1 = nums.top();
    17                 nums.pop();
    18                 int num2 = nums.top();
    19                 nums.push(num1);
    20                 nums.push(num1 + num2);
    21                 sum = sum + num1 + num2;
    22             } else {
    23                 int num = stoi(str);
    24                 nums.push(num);
    25                 sum += num;
    26             }
    27         }
    28         return sum;
    29     }
    30 };
  • 相关阅读:
    js~this的陷阱
    freemarker导出word带图片
    ok6410 u-boot-2012.04.01移植七完善u-boot移植(u-boot移植结束)
    一些编程上的小技巧
    while循环
    AIX 中以并发模式挂载vg
    老鸟的Python入门教程
    Ubuntu12.10 下搭建基于KVM-QEMU的虚拟机环境(十三)
    java中线程机制
    [置顶] 程序员求职攻略(《程序员面试笔试宝典》)之计算机相关专业读研究生还是直接就业?
  • 原文地址:https://www.cnblogs.com/gsz-/p/9483417.html
Copyright © 2011-2022 走看看