leetcode : 657,682

Author: ekxs0109

leetcode/.vscode/settings.json

@@ -59,6 +59,7 @@
   "files.associations": {
     "*.embeddedhtml": "html",
     "vector": "cpp",
-    "*.tcc": "cpp"
+    "*.tcc": "cpp",
+    "stack": "cpp"
   }
 }

leetcode/657.机器人能否返回原点.cpp

@@ -0,0 +1,47 @@
+// @before-stub-for-debug-begin
+#include <vector>
+#include <string>
+#include "commoncppproblem657.h"
+
+using namespace std;
+// @before-stub-for-debug-end
+
+/*
+ * @lc app=leetcode.cn id=657 lang=cpp
+ *
+ * [657] 机器人能否返回原点
+ */
+
+// @lc code=start
+class Solution {
+public:
+    bool judgeCircle(string moves) {
+        int x = 0;
+        int y = 0;
+
+
+        for(auto ch:moves){
+            switch (ch)
+            {
+            case 'U':
+                y++;
+                break;
+            case 'D':
+                y--;
+                break;
+            case 'L':
+                x--;
+                break;
+            case 'R':
+                x++;
+                break;
+            default:
+                break;
+            }
+        }
+
+        return x==0 && y==0;
+    }
+};
+// @lc code=end
+

leetcode/682.棒球比赛.cpp

@@ -0,0 +1,60 @@
+// @before-stub-for-debug-begin
+#include <vector>
+#include <string>
+#include <stack>
+#include "commoncppproblem682.h"
+
+using namespace std;
+// @before-stub-for-debug-end
+
+/*
+ * @lc app=leetcode.cn id=682 lang=cpp
+ *
+ * [682] 棒球比赛
+ */
+
+// @lc code=start
+
+
+
+
+class Solution {
+public:
+    int calPoints(vector<string>& operations) {
+        stack<string> stk;
+        string left = "";
+        string right = "";
+
+        for(auto op: operations){
+            switch (op[0])
+            {
+            case 'C':
+                stk.pop();
+                break;
+            case 'D':
+                left = stk.top();
+                stk.push(to_string(stoi(left) * stoi(left)));
+                break;
+            case '+':
+                
+                stk.pop();
+                right = stk.pop();
+                stk.push(to_string(stoi(left) + stoi(right)));
+                break;
+            default:
+                stk.push(op);
+                break;
+            }
+        }
+
+        int res = 0
+        {
+            res+=stoi(stk.top());
+            stk.pop();
+        }
+
+        return res;
+    }
+};
+// @lc code=end
+