feat: add java and python solutions to leetcode problem: No.0682

添加 LeetCode No.0682 题解

Author: yanglbme

solution/0600-0699/0682.Baseball Game/README.md

@@ -53,22 +53,59 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+栈实现。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def calPoints(self, ops: List[str]) -> int:
+        stack = []
+        for op in ops:
+            if op == 'C':
+                stack.pop()
+            elif op == 'D':
+                stack.append(stack[-1] << 1)
+            elif op == '+':
+                stack.append(stack[-1] + stack[-2])
+            else:
+                stack.append(int(op))
+        return sum(stack)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int calPoints(String[] ops) {
+        Deque<Integer> stack = new ArrayDeque<>();
+        for (String op : ops) {
+            if ("C".equals(op)) {
+                stack.pop();
+            } else if ("D".equals(op)) {
+                stack.push(stack.peek() << 1);
+            } else if ("+".equals(op)) {
+                Integer a = stack.pop();
+                Integer b = stack.peek();
+                stack.push(a);
+                stack.push(a + b);
+            } else {
+                stack.push(Integer.valueOf(op));
+            }
+        }
+        int res = 0;
+        for (Integer score : stack) {
+            res += score;
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0600-0699/0682.Baseball Game/README_EN.md

@@ -109,13 +109,48 @@ Round 7: You could get 9 + 5 = 14 points. The sum is 27.
 ### **Python3**
 
 ```python
-
+class Solution:
+    def calPoints(self, ops: List[str]) -> int:
+        stack = []
+        for op in ops:
+            if op == 'C':
+                stack.pop()
+            elif op == 'D':
+                stack.append(stack[-1] << 1)
+            elif op == '+':
+                stack.append(stack[-1] + stack[-2])
+            else:
+                stack.append(int(op))
+        return sum(stack)
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int calPoints(String[] ops) {
+        Deque<Integer> stack = new ArrayDeque<>();
+        for (String op : ops) {
+            if ("C".equals(op)) {
+                stack.pop();
+            } else if ("D".equals(op)) {
+                stack.push(stack.peek() << 1);
+            } else if ("+".equals(op)) {
+                Integer a = stack.pop();
+                Integer b = stack.peek();
+                stack.push(a);
+                stack.push(a + b);
+            } else {
+                stack.push(Integer.valueOf(op));
+            }
+        }
+        int res = 0;
+        for (Integer score : stack) {
+            res += score;
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/0600-0699/0682.Baseball Game/Solution.java

@@ -0,0 +1,24 @@
+class Solution {
+    public int calPoints(String[] ops) {
+        Deque<Integer> stack = new ArrayDeque<>();
+        for (String op : ops) {
+            if ("C".equals(op)) {
+                stack.pop();
+            } else if ("D".equals(op)) {
+                stack.push(stack.peek() << 1);
+            } else if ("+".equals(op)) {
+                Integer a = stack.pop();
+                Integer b = stack.peek();
+                stack.push(a);
+                stack.push(a + b);
+            } else {
+                stack.push(Integer.valueOf(op));
+            }
+        }
+        int res = 0;
+        for (Integer score : stack) {
+            res += score;
+        }
+        return res;
+    }
+}

solution/0600-0699/0682.Baseball Game/Solution.py

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