Leetcode. 682. Baseball Game

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

两鬓已不能斑白

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

阅读量718

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/u010429424/article/details/78229676

版权

LeetCode 专栏收录该内容

96 篇文章 0 订阅

订阅专栏

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:

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.

思路：

用LinkedList辅助实现，并设置变量sum，记录和。
如果是C，删掉LinkedList最后的元素，并且sum要减去最后元素的值；
如果是D，LinkedList最后元素要乘以2，并将结果加入到LinkedList中，最后sum要加上这个结果；
如果是+，LinkedList最后两个元素相加，并将结果加入到LinkedList中，最后sum要加上这个结果；

class Solution {
    public int calPoints(String[] ops) {
        LinkedList<Integer> list = new LinkedList();
        int sum = 0;
        for(int i = 0; i < ops.length; i++) {
            if("C".equals(ops[i])) {
                sum -= list.removeLast();
            }else if("D".equals(ops[i])) {
                list.add(list.getLast() << 1);
                sum += list.getLast();
            }else if("+".equals(ops[i])) {
                int a = list.removeLast();
                int b = list.getLast();
                list.add(a);
                list.add(a + b);
                sum += a+b;
            }else {
                int n = Integer.parseInt(ops[i]);
                list.add(n);
                sum += n;
            }
        }
        return sum;
    }
}