LeetCode 682. Baseball Game

最新推荐文章于 2019-09-02 23:53:29 发布

Inequality-Sign

最新推荐文章于 2019-09-02 23:53:29 发布

阅读量178

点赞数

分类专栏：数据结构与算法文章标签： leetcode

本文链接：https://blog.csdn.net/ymybxx/article/details/79567192

版权

数据结构与算法专栏收录该内容

106 篇文章 0 订阅

订阅专栏

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.


public int calPoints(String[] ops) {
        int length = ops.length;
        List<Integer> points = new ArrayList<Integer>();
        int sum = 0;
        int fu = 1;
        for (int i = 0; i < length; i++) {
            //移除上一次有效的得分
            if(ops[i].equals("C")) points.remove(points.size() - 1);
            else if(ops[i].equals("D")) points.add(2 * (points.get(points.size() - 1)));
            else if(ops[i].equals("+")) points.add(points.get(points.size() - 1) + points.get(points.size() - 2));
            else points.add(Integer.parseInt(ops[i]));
        }
        if(points.size() == 0) return 0;
        for(int i : points) sum = sum + i;
        return sum;
    }