LeetCode-682 Baseball Game Solution (with Java)

1. Description:

 Notes:

2. Examples:

3.Solutions:

/**
 * Created by sheepcore on 2018-12-24
 */
class Solution {
    public int calPoints(String[] ops) {
        Stack<Integer> numStack = new Stack<>();
        String op;
        for(int i = 0; i < ops.length; i++){
            op = ops[i];
            if(op.matches("-?\d+"))
                numStack.push(Integer.parseInt(op));

            //cut off the point in last round
            else if(op.equals("C") || op.equals("c"))
                numStack.pop();
            //double the point in last round
            else if(op.equals("D") || op.equals("d")){
                int top = numStack.peek();
                numStack.push((top << 1));
            }
            //add the last two round numbers
            else if(op.equals("+")){
                int top = numStack.pop();
                int stop = numStack.peek();
                numStack.push(top);
                numStack.push(top + stop);
            }
            //go cycling if not reach the end
            else
                continue;
        }
        int totalPoints = 0;
        Iterator<Integer> iterator = numStack.iterator();
        while(iterator.hasNext()){
            totalPoints += iterator.next();
        }
        return totalPoints;
    }
}