##### Welcome to Subscribe On Youtube
• import java.util.Stack;

/**

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 class Baseball_Game {
class Solution {
public int calPoints(String[] ops) {
Stack<Integer> stack = new Stack();

for(String op : ops) {
if (op.equals("+")) {
int top = stack.pop();
int newtop = top + stack.peek();
stack.push(top);
stack.push(newtop);
} else if (op.equals("C")) {
stack.pop();
} else if (op.equals("D")) {
stack.push(2 * stack.peek());
} else {
stack.push(Integer.valueOf(op));
}
}

int ans = 0;
for(int score : stack) ans += score;
return ans;
}
}
}

############

class Solution {
public int calPoints(String[] ops) {
Deque<Integer> stk = new ArrayDeque<>();
for (String op : ops) {
if ("+".equals(op)) {
int a = stk.pop();
int b = stk.peek();
stk.push(a);
stk.push(a + b);
} else if ("D".equals(op)) {
stk.push(stk.peek() << 1);
} else if ("C".equals(op)) {
stk.pop();
} else {
stk.push(Integer.valueOf(op));
}
}
return stk.stream().mapToInt(Integer::intValue).sum();
}
}

• // OJ: https://leetcode.com/problems/baseball-game/
// Time: O(N)
// Space: O(N)
class Solution {
public:
int calPoints(vector<string>& A) {
vector<int> v;
for (auto &w : A) {
if (isdigit(w.back())) v.push_back(stoi(w));
else if (w == "+") v.push_back(v.back() + v[v.size() - 2]);
else if (w == "D") v.push_back(v.back() * 2);
else v.pop_back();
}
return accumulate(begin(v), end(v), 0);
}
};

• class Solution:
def calPoints(self, ops: List[str]) -> int:
stk = []
for op in ops:
if op == '+':
stk.append(stk[-1] + stk[-2])
elif op == 'D':
stk.append(stk[-1] << 1)
elif op == 'C':
stk.pop()
else:
stk.append(int(op))
return sum(stk)

############

class Solution(object):
def calPoints(self, ops):
"""
:type ops: List[str]
:rtype: int
"""
valid = []
for op in ops:
if op == 'C':
valid.pop()
elif op == 'D':
valid.append(valid[-1] * 2)
elif op == '+':
valid.append(valid[-1] + valid[-2])
else:
valid.append(int(op))
return sum(valid)

• func calPoints(ops []string) int {
var stk []int
for _, op := range ops {
n := len(stk)
switch op {
case "+":
stk = append(stk, stk[n-1]+stk[n-2])
case "D":
stk = append(stk, stk[n-1]*2)
case "C":
stk = stk[:n-1]
default:
num, _ := strconv.Atoi(op)
stk = append(stk, num)
}
}
ans := 0
for _, score := range stk {
ans += score
}
return ans
}

• function calPoints(ops: string[]): number {
const stack = [];
for (const op of ops) {
const n = stack.length;
if (op === '+') {
stack.push(stack[n - 1] + stack[n - 2]);
} else if (op === 'D') {
stack.push(stack[n - 1] * 2);
} else if (op === 'C') {
stack.pop();
} else {
stack.push(Number(op));
}
}
return stack.reduce((p, v) => p + v);
}


• impl Solution {
pub fn cal_points(ops: Vec<String>) -> i32 {
let mut stack = vec![];
for op in ops {
match op.as_str() {
"+" => {
let n = stack.len();
stack.push(stack[n - 1] + stack[n - 2]);
}
"D" => {
stack.push(stack.last().unwrap() * 2);
}
"C" => {
stack.pop();
}
n => {
stack.push(n.parse::<i32>().unwrap());
}
}
}
stack.into_iter().sum()
}
}


• class Solution {
public int calPoints(String[] ops) {
int length = ops.length;
Stack<Integer> stack = new Stack<Integer>();
int score = 0;
for (int i = 0; i < length; i++) {
String str = ops[i];
if (str.equals("+")) {
int num2 = stack.pop();
int num1 = stack.pop();
int sum = num1 + num2;
stack.push(num1);
stack.push(num2);
stack.push(sum);
score += sum;
} else if (str.equals("D")) {
int lastScore = stack.peek();
int newScore = lastScore * 2;
stack.push(newScore);
score += newScore;
} else if (str.equals("C")) {
int prevScore = stack.pop();
score -= prevScore;
} else {
int points = Integer.parseInt(str);
stack.push(points);
score += points;
}
}
return score;
}
}

############

class Solution {
public int calPoints(String[] ops) {
Deque<Integer> stk = new ArrayDeque<>();
for (String op : ops) {
if ("+".equals(op)) {
int a = stk.pop();
int b = stk.peek();
stk.push(a);
stk.push(a + b);
} else if ("D".equals(op)) {
stk.push(stk.peek() << 1);
} else if ("C".equals(op)) {
stk.pop();
} else {
stk.push(Integer.valueOf(op));
}
}
return stk.stream().mapToInt(Integer::intValue).sum();
}
}

• // OJ: https://leetcode.com/problems/baseball-game/
// Time: O(N)
// Space: O(N)
class Solution {
public:
int calPoints(vector<string>& A) {
vector<int> v;
for (auto &w : A) {
if (isdigit(w.back())) v.push_back(stoi(w));
else if (w == "+") v.push_back(v.back() + v[v.size() - 2]);
else if (w == "D") v.push_back(v.back() * 2);
else v.pop_back();
}
return accumulate(begin(v), end(v), 0);
}
};

• class Solution:
def calPoints(self, ops: List[str]) -> int:
stk = []
for op in ops:
if op == '+':
stk.append(stk[-1] + stk[-2])
elif op == 'D':
stk.append(stk[-1] << 1)
elif op == 'C':
stk.pop()
else:
stk.append(int(op))
return sum(stk)

############

class Solution(object):
def calPoints(self, ops):
"""
:type ops: List[str]
:rtype: int
"""
valid = []
for op in ops:
if op == 'C':
valid.pop()
elif op == 'D':
valid.append(valid[-1] * 2)
elif op == '+':
valid.append(valid[-1] + valid[-2])
else:
valid.append(int(op))
return sum(valid)

• func calPoints(ops []string) int {
var stk []int
for _, op := range ops {
n := len(stk)
switch op {
case "+":
stk = append(stk, stk[n-1]+stk[n-2])
case "D":
stk = append(stk, stk[n-1]*2)
case "C":
stk = stk[:n-1]
default:
num, _ := strconv.Atoi(op)
stk = append(stk, num)
}
}
ans := 0
for _, score := range stk {
ans += score
}
return ans
}

• function calPoints(ops: string[]): number {
const stack = [];
for (const op of ops) {
const n = stack.length;
if (op === '+') {
stack.push(stack[n - 1] + stack[n - 2]);
} else if (op === 'D') {
stack.push(stack[n - 1] * 2);
} else if (op === 'C') {
stack.pop();
} else {
stack.push(Number(op));
}
}
return stack.reduce((p, v) => p + v);
}


• impl Solution {
pub fn cal_points(ops: Vec<String>) -> i32 {
let mut stack = vec![];
for op in ops {
match op.as_str() {
"+" => {
let n = stack.len();
stack.push(stack[n - 1] + stack[n - 2]);
}
"D" => {
stack.push(stack.last().unwrap() * 2);
}
"C" => {
stack.pop();
}
n => {
stack.push(n.parse::<i32>().unwrap());
}
}
}
stack.into_iter().sum()
}
}