solve problem Basebell Game

Author: P-ppc

README.md

@@ -32,4 +32,5 @@ All solutions will be accepted!
 |485|[Max Consecutive Ones](https://leetcode-cn.com/problems/max-consecutive-ones/description/)|[java/py/js](./algorithms/MaxConsecutiveOnes)|Easy|
 |191|[Number Of 1 Bits](https://leetcode-cn.com/problems/number-of-1-bits/description/)|[java/py/js](./algorithms/NumberOf1Bits)|Easy|
 |258|[Add Digits](https://leetcode-cn.com/problems/add-digits/description/)|[java/py/js](./algorithms/AddDigits)|Easy|
-|520|[Detect Capital](https://leetcode-cn.com/problems/detect-capital/description/)|[java/py/js](./algorithms/DetectCaptial)|Easy|
+|520|[Detect Capital](https://leetcode-cn.com/problems/detect-capital/description/)|[java/py/js](./algorithms/DetectCaptial)|Easy|
+|682|[BaseBall Game](https://leetcode-cn.com/problems/baseball-game/description/)|[java/py/js](./algorithms/BaseBallGame)|Easy|

algorithms/BaseballGame/README.md

@@ -0,0 +1,2 @@
+# Baseball Game
+This problem is easy to solve

algorithms/BaseballGame/Solution.java

@@ -0,0 +1,23 @@
+class Solution {
+    public int calPoints(String[] ops) {
+        List<Integer> scoreStack = new ArrayList<Integer>();
+        
+        for (String op : ops) {
+            int size = scoreStack.size();
+            if (op.equals("+")) {
+                scoreStack.add(scoreStack.get(size - 2) + scoreStack.get(size - 1));
+            } else if (op.equals("C")) {
+                scoreStack.remove(size - 1);
+            } else if (op.equals("D")) {
+                scoreStack.add(2 * scoreStack.get(size - 1));
+            } else {
+                scoreStack.add(Integer.parseInt(op));
+            }
+        }
+        int sum = 0;
+        for (int i : scoreStack) {
+            sum += i;
+        }
+        return sum;
+    }
+}

algorithms/BaseballGame/solution.js

@@ -0,0 +1,19 @@
+/**
+ * @param {string[]} ops
+ * @return {number}
+ */
+var calPoints = function(ops) {
+    let scoreStack = []
+    ops.forEach(op => {
+        if (op === '+') {
+            scoreStack.push(scoreStack[scoreStack.length - 2] + scoreStack[scoreStack.length - 1])
+        } else if (op === 'C') {
+            scoreStack.splice(scoreStack.length - 1, 1)
+        } else if (op === 'D') {
+            scoreStack.push(2 * scoreStack[scoreStack.length - 1])
+        } else {
+            scoreStack.push(parseInt(op))
+        }
+    })
+    return scoreStack.reduce((x, y) => x + y, 0)
+};

algorithms/BaseballGame/solution.py

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