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.

思路：

LinkedList

class Solution {
    public int calPoints(String[] ops) {
        int res = 0;
        LinkedList<Integer> list = new LinkedList<>();
        for (String s : ops)
        {
            if (s.equals("C"))
                res -= list.removeLast();
            else if (s.equals("D"))
            {
                list.addLast(list.peekLast() * 2);
                res += list.peekLast();
            }
            else if (s.equals("+"))
            {
                list.addLast(list.peekLast() + list.get(list.size() - 2));
                res += list.peekLast();
            }
            else
            {
                list.addLast(Integer.valueOf(s));
                res += list.peekLast();
            }
        }
        return res;
    }
}

Stack

class Solution {
    public int calPoints(String[] ops) {
        int res = 0;
        int a = 0;
        int b = 0;
        Stack<Integer> stack = new Stack<>();
        for (String s : ops)
        {
            if (s.equals("C"))
                res -= stack.pop();
            else if (s.equals("D"))
            {
                stack.push(stack.peek() * 2);
                res += stack.peek();
            }
            else if (s.equals("+"))
            {
                a = stack.pop();
                b = a + stack.peek();
                stack.push(a);
                stack.push(b);
                res += stack.peek();
            }
            else
            {
                stack.push(Integer.valueOf(s));
                res += stack.peek();
            }
        }
        return res;
    }
}

数组

class Solution {
    public int calPoints(String[] ops) {
        int res = 0;
        int[] valid = new int[ops.length];
        int index = -1;
        for (String s : ops)
        {
            if (s.equals("C"))
            {
                res -= valid[index];
                index--;
            }
            else if (s.equals("D"))
            {
                int tmp = valid[index] * 2;
                index++;
                valid[index] = tmp;
                res += tmp;
            }
            else if (s.equals("+"))
            {
                int tmp2 = valid[index] + valid[index - 1];
                index++;
                valid[index] = tmp2;
                res += tmp2;
            }
            else
            {
                int val = Integer.parseInt(s);
                index++;
                valid[index] = val;
                res += val;
            }
        }
        return res;
    }
}