leetcode 682. Baseball Game（篮球游戏）

You are keeping score for a baseball game with strange rules. The game consists of several rounds, where the scores of past rounds may affect future rounds’ scores.

At the beginning of the game, you start with an empty record. You are given a list of strings ops, where ops[i] is the ith operation you must apply to the record and is one of the following:

An integer x - Record a new score of x.
“+” - Record a new score that is the sum of the previous two scores. It is guaranteed there will always be two previous scores.
“D” - Record a new score that is double the previous score. It is guaranteed there will always be a previous score.
“C” - Invalidate the previous score, removing it from the record. It is guaranteed there will always be a previous score.
Return the sum of all the scores on the record.

Example 1:

Input: ops = [“5”,“2”,“C”,“D”,“+”]
Output: 30
Explanation:
“5” - Add 5 to the record, record is now [5].
“2” - Add 2 to the record, record is now [5, 2].
“C” - Invalidate and remove the previous score, record is now [5].
“D” - Add 2 * 5 = 10 to the record, record is now [5, 10].
“+” - Add 5 + 10 = 15 to the record, record is now [5, 10, 15].
The total sum is 5 + 10 + 15 = 30.

题有点长，简单说就是遇到数字压入，遇到C去掉最后一个数字，遇到D压入双倍最后的数字，+就是压入最后俩数的和。

思路：
简单的用个stack，压栈出栈操作。

    public int calPoints(String[] ops) {
        Stack<Integer> st = new Stack<>();
        int num = 0;
        int sum = 0;
        int res = 0;
        
        for(String op : ops) {
            switch(op) {
                case "C":
                    st.pop();
                    break;
                case "D":
                    num = st.peek();
                    st.push(num * 2);
                    break;
                case "+":
                    num = st.pop();
                    sum = num + st.peek();
                    st.push(num);
                    st.push(sum);
                    break;
                default:
                    num = Integer.parseInt(op);
                    st.push(num);
            }
        }
        
        for(Integer number : st) {
            res += number;
        }
        return res;
    }