diff --git a/lcci/16.26.Calculator/README.md b/lcci/16.26.Calculator/README.md
index a8bda84ae9366..eed6523adfa73 100644
--- a/lcci/16.26.Calculator/README.md
+++ b/lcci/16.26.Calculator/README.md
@@ -5,6 +5,7 @@
## 题目描述
+
给定一个包含正整数、加(+)、减(-)、乘(*)、除(/)的算数表达式(括号除外),计算其结果。
表达式仅包含非负整数,+, - ,*,/ 四种运算符和空格 。 整数除法仅保留整数部分。
示例 1:
@@ -27,6 +28,15 @@
## 解法
+
+**方法一:栈**
+
+我们可以用一个栈来保存数字,每次遇到运算符时,就将数字压入栈中。对于加减法,由于其优先级最低,我们可以直接将数字压入栈中;对于乘除法,由于其优先级较高,我们需要将栈顶元素取出,与当前数字进行乘除运算,再将结果压入栈中。
+
+最后,将栈中所有元素求和即为答案。
+
+时间复杂度 $O(n),ドル空间复杂度 $O(n)$。其中 $n$ 为字符串长度。
+
### **Python3**
@@ -34,7 +44,28 @@
```python
-
+class Solution:
+ def calculate(self, s: str) -> int:
+ n = len(s)
+ x = 0
+ sign = "+"
+ stk = []
+ for i, c in enumerate(s):
+ if c.isdigit():
+ x = x * 10 + ord(c) - ord("0")
+ if i == n - 1 or c in "+-*/":
+ match sign:
+ case "+":
+ stk.append(x)
+ case "-":
+ stk.append(-x)
+ case "*":
+ stk.append(stk.pop() * x)
+ case "/":
+ stk.append(int(stk.pop() / x))
+ x = 0
+ sign = c
+ return sum(stk)
```
### **Java**
@@ -42,7 +73,146 @@
```java
+class Solution {
+ public int calculate(String s) {
+ int n = s.length();
+ int x = 0;
+ char sign = '+';
+ Deque stk = new ArrayDeque();
+ for (int i = 0; i < n; ++i) { + char c = s.charAt(i); + if (Character.isDigit(c)) { + x = x * 10 + (c - '0'); + } + if (i == n - 1 || !Character.isDigit(c) && c != ' ') { + switch (sign) { + case '+' -> stk.push(x);
+ case '-' -> stk.push(-x);
+ case '*' -> stk.push(stk.pop() * x);
+ case '/' -> stk.push(stk.pop() / x);
+ }
+ x = 0;
+ sign = c;
+ }
+ }
+ int ans = 0;
+ while (!stk.isEmpty()) {
+ ans += stk.pop();
+ }
+ return ans;
+ }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+ int calculate(string s) {
+ int n = s.size();
+ int x = 0;
+ char sign = '+';
+ stack stk;
+ for (int i = 0; i < n; ++i) { + char c = s[i]; + if (isdigit(c)) { + x = x * 10 + (c - '0'); + } + if (i == n - 1 || !isdigit(c) && c != ' ') { + if (sign == '+') { + stk.push(x); + } else if (sign == '-') { + stk.push(-x); + } else if (sign == '*') { + int y = stk.top(); + stk.pop(); + stk.push(y * x); + } else if (sign == '/') { + int y = stk.top(); + stk.pop(); + stk.push(y / x); + } + x = 0; + sign = c; + } + } + int ans = 0; + while (!stk.empty()) { + ans += stk.top(); + stk.pop(); + } + return ans; + } +}; +``` + +### **Go** + +```go +func calculate(s string) (ans int) { + n := len(s) + x := 0 + sign := '+' + stk := []int{} + for i := range s { + if s[i]>= '0' && s[i] <= '9' { + x = x*10 + int(s[i]-'0') + } + if i == n-1 || (s[i] != ' ' && (s[i] < '0' || s[i]> '9')) {
+ switch sign {
+ case '+':
+ stk = append(stk, x)
+ case '-':
+ stk = append(stk, -x)
+ case '*':
+ stk[len(stk)-1] *= x
+ case '/':
+ stk[len(stk)-1] /= x
+ }
+ x = 0
+ sign = rune(s[i])
+ }
+ }
+ for _, x := range stk {
+ ans += x
+ }
+ return
+}
+```
+### **TypeScript**
+
+```ts
+function calculate(s: string): number {
+ const n = s.length;
+ let x = 0;
+ let sign = '+';
+ const stk: number[] = [];
+ for (let i = 0; i < n; ++i) { + if (!isNaN(Number(s[i])) && s[i] !== ' ') { + x = x * 10 + s[i].charCodeAt(0) - '0'.charCodeAt(0); + } + if (i === n - 1 || (isNaN(Number(s[i])) && s[i] !== ' ')) { + switch (sign) { + case '+': + stk.push(x); + break; + case '-': + stk.push(-x); + break; + case '*': + stk.push(stk.pop()! * x); + break; + default: + stk.push((stk.pop()! / x) | 0); + } + x = 0; + sign = s[i]; + } + } + return stk.reduce((x, y) => x + y);
+}
```
### **...**
diff --git a/lcci/16.26.Calculator/README_EN.md b/lcci/16.26.Calculator/README_EN.md
index 9ab2eea5e705c..47826a1016c3e 100644
--- a/lcci/16.26.Calculator/README_EN.md
+++ b/lcci/16.26.Calculator/README_EN.md
@@ -42,13 +42,173 @@
### **Python3**
```python
-
+class Solution:
+ def calculate(self, s: str) -> int:
+ n = len(s)
+ x = 0
+ sign = "+"
+ stk = []
+ for i, c in enumerate(s):
+ if c.isdigit():
+ x = x * 10 + ord(c) - ord("0")
+ if i == n - 1 or c in "+-*/":
+ match sign:
+ case "+":
+ stk.append(x)
+ case "-":
+ stk.append(-x)
+ case "*":
+ stk.append(stk.pop() * x)
+ case "/":
+ stk.append(int(stk.pop() / x))
+ x = 0
+ sign = c
+ return sum(stk)
```
### **Java**
```java
+class Solution {
+ public int calculate(String s) {
+ int n = s.length();
+ int x = 0;
+ char sign = '+';
+ Deque stk = new ArrayDeque();
+ for (int i = 0; i < n; ++i) { + char c = s.charAt(i); + if (Character.isDigit(c)) { + x = x * 10 + (c - '0'); + } + if (i == n - 1 || !Character.isDigit(c) && c != ' ') { + switch (sign) { + case '+' -> stk.push(x);
+ case '-' -> stk.push(-x);
+ case '*' -> stk.push(stk.pop() * x);
+ case '/' -> stk.push(stk.pop() / x);
+ }
+ x = 0;
+ sign = c;
+ }
+ }
+ int ans = 0;
+ while (!stk.isEmpty()) {
+ ans += stk.pop();
+ }
+ return ans;
+ }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+ int calculate(string s) {
+ int n = s.size();
+ int x = 0;
+ char sign = '+';
+ stack stk;
+ for (int i = 0; i < n; ++i) { + char c = s[i]; + if (isdigit(c)) { + x = x * 10 + (c - '0'); + } + if (i == n - 1 || !isdigit(c) && c != ' ') { + if (sign == '+') { + stk.push(x); + } else if (sign == '-') { + stk.push(-x); + } else if (sign == '*') { + int y = stk.top(); + stk.pop(); + stk.push(y * x); + } else if (sign == '/') { + int y = stk.top(); + stk.pop(); + stk.push(y / x); + } + x = 0; + sign = c; + } + } + int ans = 0; + while (!stk.empty()) { + ans += stk.top(); + stk.pop(); + } + return ans; + } +}; +``` + +### **Go** + +```go +func calculate(s string) (ans int) { + n := len(s) + x := 0 + sign := '+' + stk := []int{} + for i := range s { + if s[i]>= '0' && s[i] <= '9' { + x = x*10 + int(s[i]-'0') + } + if i == n-1 || (s[i] != ' ' && (s[i] < '0' || s[i]> '9')) {
+ switch sign {
+ case '+':
+ stk = append(stk, x)
+ case '-':
+ stk = append(stk, -x)
+ case '*':
+ stk[len(stk)-1] *= x
+ case '/':
+ stk[len(stk)-1] /= x
+ }
+ x = 0
+ sign = rune(s[i])
+ }
+ }
+ for _, x := range stk {
+ ans += x
+ }
+ return
+}
+```
+### **TypeScript**
+
+```ts
+function calculate(s: string): number {
+ const n = s.length;
+ let x = 0;
+ let sign = '+';
+ const stk: number[] = [];
+ for (let i = 0; i < n; ++i) { + if (!isNaN(Number(s[i])) && s[i] !== ' ') { + x = x * 10 + s[i].charCodeAt(0) - '0'.charCodeAt(0); + } + if (i === n - 1 || (isNaN(Number(s[i])) && s[i] !== ' ')) { + switch (sign) { + case '+': + stk.push(x); + break; + case '-': + stk.push(-x); + break; + case '*': + stk.push(stk.pop()! * x); + break; + default: + stk.push((stk.pop()! / x) | 0); + } + x = 0; + sign = s[i]; + } + } + return stk.reduce((x, y) => x + y);
+}
```
### **...**
diff --git a/lcci/16.26.Calculator/Solution.cpp b/lcci/16.26.Calculator/Solution.cpp
new file mode 100644
index 0000000000000..143453c0e385d
--- /dev/null
+++ b/lcci/16.26.Calculator/Solution.cpp
@@ -0,0 +1,38 @@
+class Solution {
+public:
+ int calculate(string s) {
+ int n = s.size();
+ int x = 0;
+ char sign = '+';
+ stack stk;
+ for (int i = 0; i < n; ++i) { + char c = s[i]; + if (isdigit(c)) { + x = x * 10 + (c - '0'); + } + if (i == n - 1 || !isdigit(c) && c != ' ') { + if (sign == '+') { + stk.push(x); + } else if (sign == '-') { + stk.push(-x); + } else if (sign == '*') { + int y = stk.top(); + stk.pop(); + stk.push(y * x); + } else if (sign == '/') { + int y = stk.top(); + stk.pop(); + stk.push(y / x); + } + x = 0; + sign = c; + } + } + int ans = 0; + while (!stk.empty()) { + ans += stk.top(); + stk.pop(); + } + return ans; + } +}; \ No newline at end of file diff --git a/lcci/16.26.Calculator/Solution.go b/lcci/16.26.Calculator/Solution.go new file mode 100644 index 0000000000000..4ebdb08141081 --- /dev/null +++ b/lcci/16.26.Calculator/Solution.go @@ -0,0 +1,29 @@ +func calculate(s string) (ans int) { + n := len(s) + x := 0 + sign := '+' + stk := []int{} + for i := range s { + if s[i]>= '0' && s[i] <= '9' { + x = x*10 + int(s[i]-'0') + } + if i == n-1 || (s[i] != ' ' && (s[i] < '0' || s[i]> '9')) {
+ switch sign {
+ case '+':
+ stk = append(stk, x)
+ case '-':
+ stk = append(stk, -x)
+ case '*':
+ stk[len(stk)-1] *= x
+ case '/':
+ stk[len(stk)-1] /= x
+ }
+ x = 0
+ sign = rune(s[i])
+ }
+ }
+ for _, x := range stk {
+ ans += x
+ }
+ return
+}
\ No newline at end of file
diff --git a/lcci/16.26.Calculator/Solution.java b/lcci/16.26.Calculator/Solution.java
new file mode 100644
index 0000000000000..ca9dac83933d4
--- /dev/null
+++ b/lcci/16.26.Calculator/Solution.java
@@ -0,0 +1,29 @@
+class Solution {
+ public int calculate(String s) {
+ int n = s.length();
+ int x = 0;
+ char sign = '+';
+ Deque stk = new ArrayDeque();
+ for (int i = 0; i < n; ++i) { + char c = s.charAt(i); + if (Character.isDigit(c)) { + x = x * 10 + (c - '0'); + } + if (i == n - 1 || !Character.isDigit(c) && c != ' ') { + switch (sign) { + case '+' -> stk.push(x);
+ case '-' -> stk.push(-x);
+ case '*' -> stk.push(stk.pop() * x);
+ case '/' -> stk.push(stk.pop() / x);
+ }
+ x = 0;
+ sign = c;
+ }
+ }
+ int ans = 0;
+ while (!stk.isEmpty()) {
+ ans += stk.pop();
+ }
+ return ans;
+ }
+}
\ No newline at end of file
diff --git a/lcci/16.26.Calculator/Solution.py b/lcci/16.26.Calculator/Solution.py
new file mode 100644
index 0000000000000..6f60853aee359
--- /dev/null
+++ b/lcci/16.26.Calculator/Solution.py
@@ -0,0 +1,22 @@
+class Solution:
+ def calculate(self, s: str) -> int:
+ n = len(s)
+ x = 0
+ sign = "+"
+ stk = []
+ for i, c in enumerate(s):
+ if c.isdigit():
+ x = x * 10 + ord(c) - ord("0")
+ if i == n - 1 or c in "+-*/":
+ match sign:
+ case "+":
+ stk.append(x)
+ case "-":
+ stk.append(-x)
+ case "*":
+ stk.append(stk.pop() * x)
+ case "/":
+ stk.append(int(stk.pop() / x))
+ x = 0
+ sign = c
+ return sum(stk)
diff --git a/lcci/16.26.Calculator/Solution.ts b/lcci/16.26.Calculator/Solution.ts
new file mode 100644
index 0000000000000..db44ab79ac1b4
--- /dev/null
+++ b/lcci/16.26.Calculator/Solution.ts
@@ -0,0 +1,29 @@
+function calculate(s: string): number {
+ const n = s.length;
+ let x = 0;
+ let sign = '+';
+ const stk: number[] = [];
+ for (let i = 0; i < n; ++i) { + if (!isNaN(Number(s[i])) && s[i] !== ' ') { + x = x * 10 + s[i].charCodeAt(0) - '0'.charCodeAt(0); + } + if (i === n - 1 || (isNaN(Number(s[i])) && s[i] !== ' ')) { + switch (sign) { + case '+': + stk.push(x); + break; + case '-': + stk.push(-x); + break; + case '*': + stk.push(stk.pop()! * x); + break; + default: + stk.push((stk.pop()! / x) | 0); + } + x = 0; + sign = s[i]; + } + } + return stk.reduce((x, y) => x + y);
+}