You are keeping the scores for a baseball game with strange rules. At the beginning of the game, you start with an empty record.
You are given a list of strings operations
, where operations[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 of
'+'
.- Record a new score that is the sum of the previous two scores.
'D'
.- Record a new score that is the double of the previous score.
'C'
.- Invalidate the previous score, removing it from the record.
Return the sum of all the scores on the record after applying all the operations.
The test cases are generated such that the answer and all intermediate calculations fit in a 32-bit integer and that all operations are valid.
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.
Example 2:
Input: ops = ["5","-2","4","C","D","9","+","+"] Output: 27 Explanation: "5" - Add 5 to the record, record is now [5]. "-2" - Add -2 to the record, record is now [5, -2]. "4" - Add 4 to the record, record is now [5, -2, 4]. "C" - Invalidate and remove the previous score, record is now [5, -2]. "D" - Add 2 * -2 = -4 to the record, record is now [5, -2, -4]. "9" - Add 9 to the record, record is now [5, -2, -4, 9]. "+" - Add -4 + 9 = 5 to the record, record is now [5, -2, -4, 9, 5]. "+" - Add 9 + 5 = 14 to the record, record is now [5, -2, -4, 9, 5, 14]. The total sum is 5 + -2 + -4 + 9 + 5 + 14 = 27.
Example 3:
Input: ops = ["1","C"] Output: 0 Explanation: "1" - Add 1 to the record, record is now [1]. "C" - Invalidate and remove the previous score, record is now []. Since the record is empty, the total sum is 0.
Constraints:
1 <= operations.length <= 1000
operations[i]
is"C"
,"D"
,"+"
, or a string representing an integer in the range[-3 * 104, 3 * 104]
.- For operation
"+"
, there will always be at least two previous scores on the record. - For operations
"C"
and"D"
, there will always be at least one previous score on the record.
这题其实很简单,类似于calculator简单版,就是按顺序给定数字和操作,求最后的计算结果。显然用stack来存放。
几个小坑:
1. string comparison得用.equals()不能用==……最最基础的问题太久没用都忘光了,太离谱了!
2. 读题很重要……把D看成了两个数相乘……debug了巨久才发现……
3. 以及最开始写了个two pass,先求完所有的score,最后遍历stack来求result。优化一下可以one pass做完。
two pass版:
class Solution {
public int calPoints(String[] operations) {
int result = 0;
Deque<Integer> stack = new ArrayDeque<>();
for (String s : operations) {
if (s.equals("+")) {
int a = stack.pop();
int b = stack.peek();
stack.push(a);
stack.push(a + b);
} else if (s.equals("C")) {
stack.pop();
} else if (s.equals("D")) {
int a = stack.peek();
stack.push(a * 2);
} else {
int a = Integer.parseInt(s);
stack.push(a);
}
}
for (int i : stack) {
result += i;
}
return result;
}
}
one pass版:
class Solution {
public int calPoints(String[] operations) {
int result = 0;
Deque<Integer> stack = new ArrayDeque<>();
for (String s : operations) {
if (s.equals("+")) {
int a = stack.pop();
int b = stack.peek();
stack.push(a);
stack.push(a + b);
result += (a + b);
} else if (s.equals("C")) {
int a = stack.pop();
result -= a;
} else if (s.equals("D")) {
int a = stack.peek();
stack.push(a * 2);
result += (a * 2);
} else {
int a = Integer.parseInt(s);
stack.push(a);
result += a;
}
}
return result;
}
}