feat: leetcode 224

Author: deweyou

assets/data/category.json

@@ -1641,6 +1641,12 @@
         "path": "../../problemset/min-stack/README.md",
         "difficulty": "简单"
       },
+      {
+        "id": 224,
+        "title": "基本计算器",
+        "path": "../../problemset/basic-calculator/README.md",
+        "difficulty": "困难"
+      },
       {
         "id": 2104,
         "title": "子数组范围和",

assets/data/problems.json

@@ -1989,6 +1989,16 @@
     "url": "https://leetcode-cn.com/problems/rectangle-area/",
     "path": "../../problemset/rectangle-area/README.md"
   },
+  {
+    "id": 224,
+    "title": {
+      "cn": "基本计算器",
+      "en": "basic-calculator"
+    },
+    "difficulty": "困难",
+    "url": "https://leetcode-cn.com/problems/basic-calculator/",
+    "path": "../../problemset/basic-calculator/README.md"
+  },
   {
     "id": 258,
     "title": {

assets/docs/CATEGORY.md

@@ -323,6 +323,7 @@
 | 98. [验证二叉搜索树](../../problemset/validate-binary-search-tree/README.md) | 中等 |
 | 150. [逆波兰表达式求值](../../problemset/valuate-reverse-polish-notation/README.md) | 中等 |
 | 155. [最小栈](../../problemset/min-stack/README.md) | 简单 |
+| 224. [基本计算器](../../problemset/basic-calculator/README.md) | 困难 |
 | 2104. [子数组范围和](../../problemset/sum-of-subarray-ranges/README.md) | 中等 |
 
 ## 递归 & 迭代

assets/docs/PROBLEMS.md

@@ -398,6 +398,8 @@
 
 [223. 矩形面积](../../problemset/rectangle-area/README.md)
 
+[224. 基本计算器](../../problemset/basic-calculator/README.md)
+
 [258. 各位相加](../../problemset/add-digits/README.md)
 
 [300. 最长递增子序列](../../problemset/longest-increasing-subsequence/README.md)

problemset/basic-calculator/README.md

@@ -0,0 +1,91 @@
+# 基本计算器
+
+> 难度：困难
+>
+> https://leetcode-cn.com/problems/basic-calculator/
+
+## 题目
+
+给你一个字符串表达式 `s` ，请你实现一个基本计算器来计算并返回它的值。
+
+注意:不允许使用任何将字符串作为数学表达式计算的内置函数，比如 `eval()` 。
+
+ 
+### 示例 
+
+#### 示例 1：
+
+```
+输入：s = "1 + 1"
+输出：2
+```
+
+#### 示例 2：
+
+```
+输入：s = " 2-1 + 2 "
+输出：3
+```
+
+#### 示例 3：
+
+```
+输入：s = "(1+(4+5+2)-3)+(6+8)"
+输出：23
+```
+
+## 解题
+
+```ts
+/**
+ * 括号展开 + 栈
+ * @desc 时间复杂度 O(N) 空间复杂度 O(N)
+ * @param s
+ * @returns
+ */
+export function calculate(s: string): number {
+  const stack = [1]
+  let sign = 1
+
+  let result = 0
+  const len = s.length
+  let i = 0
+
+  while (i < len) {
+    switch (s[i]) {
+      case ' ':
+        i++
+        break
+      case '+':
+        sign = stack[stack.length - 1]
+        i++
+        break
+      case '-':
+        sign = -stack[stack.length - 1]
+        i++
+        break
+      case '(':
+        stack.push(sign)
+        i++
+        break
+      case ')':
+        stack.pop()
+        i++
+        break
+      default:
+        numberHandler()
+    }
+  }
+
+  function numberHandler() {
+    let num = 0
+    while (i < len && !(isNaN(Number(s[i]))) && s[i] !== ' ') {
+      num = num * 10 + s[i].charCodeAt(0) - '0'.charCodeAt(0)
+      i++
+    }
+    result += sign * num
+  }
+
+  return result
+}
+```

problemset/basic-calculator/index.spec.ts

@@ -0,0 +1,16 @@
+import { describe, expect, it } from 'vitest'
+import { calculate } from '.'
+
+describe('基本计算器', () => {
+  testCase(calculate)
+})
+
+function testCase(fn: (s: string) => number) {
+  it.each([
+    ['1 + 1', 2],
+    [' 2-1 + 2 ', 3],
+    ['(1+(4+5+2)-3)+(6+8)', 23],
+  ])('示例 %#', (s, expected) => {
+    expect(fn(s)).toBe(expected)
+  })
+}

problemset/basic-calculator/index.ts

@@ -0,0 +1,51 @@
+/**
+ * 括号展开 + 栈
+ * @desc 时间复杂度 O(N) 空间复杂度 O(N)
+ * @param s
+ * @returns
+ */
+export function calculate(s: string): number {
+  const stack = [1]
+  let sign = 1
+
+  let result = 0
+  const len = s.length
+  let i = 0
+
+  while (i < len) {
+    switch (s[i]) {
+      case ' ':
+        i++
+        break
+      case '+':
+        sign = stack[stack.length - 1]
+        i++
+        break
+      case '-':
+        sign = -stack[stack.length - 1]
+        i++
+        break
+      case '(':
+        stack.push(sign)
+        i++
+        break
+      case ')':
+        stack.pop()
+        i++
+        break
+      default:
+        numberHandler()
+    }
+  }
+
+  function numberHandler() {
+    let num = 0
+    while (i < len && !(isNaN(Number(s[i]))) && s[i] !== ' ') {
+      num = num * 10 + s[i].charCodeAt(0) - '0'.charCodeAt(0)
+      i++
+    }
+    result += sign * num
+  }
+
+  return result
+}