feat: ^_^

Author: SR2k

10.正则表达式匹配.ts

@@ -0,0 +1,94 @@
+/*
+ * @lc app=leetcode.cn id=10 lang=typescript
+ *
+ * [10] 正则表达式匹配
+ *
+ * https://leetcode-cn.com/problems/regular-expression-matching/description/
+ *
+ * algorithms
+ * Hard (31.65%)
+ * Likes:    2750
+ * Dislikes: 0
+ * Total Accepted:    242.8K
+ * Total Submissions: 767.8K
+ * Testcase Example:  '"aa"\n"a"'
+ *
+ * 给你一个字符串 s 和一个字符规律 p，请你来实现一个支持 '.' 和 '*' 的正则表达式匹配。
+ *
+ *
+ * '.' 匹配任意单个字符
+ * '*' 匹配零个或多个前面的那一个元素
+ *
+ *
+ * 所谓匹配，是要涵盖 整个 字符串 s的，而不是部分字符串。
+ *
+ *
+ * 示例 1：
+ *
+ *
+ * 输入：s = "aa", p = "a"
+ * 输出：false
+ * 解释："a" 无法匹配 "aa" 整个字符串。
+ *
+ *
+ * 示例 2:
+ *
+ *
+ * 输入：s = "aa", p = "a*"
+ * 输出：true
+ * 解释：因为 '*' 代表可以匹配零个或多个前面的那一个元素, 在这里前面的元素就是 'a'。因此，字符串 "aa" 可被视为 'a' 重复了一次。
+ *
+ *
+ * 示例 3：
+ *
+ *
+ * 输入：s = "ab", p = ".*"
+ * 输出：true
+ * 解释：".*" 表示可匹配零个或多个（'*'）任意字符（'.'）。
+ *
+ *
+ *
+ *
+ * 提示：
+ *
+ *
+ * 1 <= s.length <= 20
+ * 1 <= p.length <= 30
+ * s 只包含从 a-z 的小写字母。
+ * p 只包含从 a-z 的小写字母，以及字符 . 和 *。
+ * 保证每次出现字符 * 时，前面都匹配到有效的字符
+ *
+ *
+ */
+
+export
+// @lc code=start
+function isMatch(s: string, p: string): boolean {
+  const dp = new Array(s.length + 1)
+    .fill(0)
+    .map(() => new Array(p.length + 1).fill(false))
+  dp[0][0] = true
+
+  for (let i = 0; i <= s.length; i++) {
+    const charS = s[i - 1]
+
+    for (let j = 1; j <= p.length; j++) {
+      const charP = p[j - 1]
+
+      if (i === 0) {
+        dp[i][j] = charP === '*' && dp[i][j - 2]
+      } else if (charP === '.') {
+        dp[i][j] = dp[i - 1][j - 1]
+      } else if (charP === '*' && p[j - 2] !== '.') {
+        dp[i][j] = dp[i][j - 2] || (dp[i - 1][j] && charS === p[j - 2])
+      } else if (charP === '*' && p[j - 2] === '.') {
+        dp[i][j] = dp[i][j - 2] || dp[i - 1][j]
+      } else {
+        dp[i][j] = dp[i - 1][j - 1] && charS === charP
+      }
+    }
+  }
+
+  return dp[s.length][p.length]
+}
+// @lc code=end

23.合并k个升序链表.ts

@@ -0,0 +1,94 @@
+/*
+ * @lc app=leetcode.cn id=23 lang=typescript
+ *
+ * [23] 合并K个升序链表
+ *
+ * https://leetcode-cn.com/problems/merge-k-sorted-lists/description/
+ *
+ * algorithms
+ * Hard (56.45%)
+ * Likes:    1757
+ * Dislikes: 0
+ * Total Accepted:    394.6K
+ * Total Submissions: 698.7K
+ * Testcase Example:  '[[1,4,5],[1,3,4],[2,6]]'
+ *
+ * 给你一个链表数组，每个链表都已经按升序排列。
+ *
+ * 请你将所有链表合并到一个升序链表中，返回合并后的链表。
+ *
+ *
+ *
+ * 示例 1：
+ *
+ * 输入：lists = [[1,4,5],[1,3,4],[2,6]]
+ * 输出：[1,1,2,3,4,4,5,6]
+ * 解释：链表数组如下：
+ * [
+ * ⁠ 1->4->5,
+ * ⁠ 1->3->4,
+ * ⁠ 2->6
+ * ]
+ * 将它们合并到一个有序链表中得到。
+ * 1->1->2->3->4->4->5->6
+ *
+ *
+ * 示例 2：
+ *
+ * 输入：lists = []
+ * 输出：[]
+ *
+ *
+ * 示例 3：
+ *
+ * 输入：lists = [[]]
+ * 输出：[]
+ *
+ *
+ *
+ *
+ * 提示：
+ *
+ *
+ * k == lists.length
+ * 0 <= k <= 10^4
+ * 0 <= lists[i].length <= 500
+ * -10^4 <= lists[i][j] <= 10^4
+ * lists[i] 按 升序 排列
+ * lists[i].length 的总和不超过 10^4
+ *
+ *
+ */
+
+import { PriorityQueue } from '@datastructures-js/priority-queue'
+import { ListNode } from './commons/list'
+
+export
+// @lc code=start
+function mergeKLists(lists: Array<ListNode | null>): ListNode | null {
+  const priorityQueue = new PriorityQueue<ListNode<number>>({
+    compare: (a, b) => a.val - b.val,
+  })
+  for (const n of lists) {
+    if (n) {
+      priorityQueue.enqueue(n)
+    }
+  }
+
+  const dummyHead = new ListNode(-1)
+  let prev = dummyHead
+  while (!priorityQueue.isEmpty()) {
+    const node = priorityQueue.dequeue() as ListNode<number>
+    prev.next = node
+    prev = node
+
+    if (node.next) {
+      priorityQueue.enqueue(node.next)
+    }
+  }
+
+  return dummyHead.next
+}
+
+// FIXME: 不能提交！！！LeetCode 没得 PriorityQueue！！
+// @lc code=end

285.二叉搜索树中的中序后继.ts

@@ -0,0 +1,95 @@
+/*
+ * @lc app=leetcode.cn id=285 lang=typescript
+ *
+ * [285] 二叉搜索树中的中序后继
+ *
+ * https://leetcode-cn.com/problems/inorder-successor-in-bst/description/
+ *
+ * algorithms
+ * Medium (63.82%)
+ * Likes:    149
+ * Dislikes: 0
+ * Total Accepted:    10K
+ * Total Submissions: 15.6K
+ * Testcase Example:  '[2,1,3]\n1'
+ *
+ * 给定一棵二叉搜索树和其中的一个节点 p ，找到该节点在树中的中序后继。如果节点没有中序后继，请返回 null 。
+ *
+ * 节点 p 的后继是值比 p.val 大的节点中键值最小的节点。
+ *
+ *
+ *
+ * 示例 1：
+ *
+ *
+ *
+ *
+ * 输入：root = [2,1,3], p = 1
+ * 输出：2
+ * 解释：这里 1 的中序后继是 2。请注意 p 和返回值都应是 TreeNode 类型。
+ *
+ *
+ * 示例 2：
+ *
+ *
+ *
+ *
+ * 输入：root = [5,3,6,2,4,null,null,1], p = 6
+ * 输出：null
+ * 解释：因为给出的节点没有中序后继，所以答案就返回 null 了。
+ *
+ *
+ *
+ *
+ * 提示：
+ *
+ *
+ * 树中节点的数目在范围 [1, 10^4] 内。
+ * -10^5
+ * 树中各节点的值均保证唯一。
+ *
+ *
+ */
+
+import { TreeNode } from './commons/Tree'
+
+export
+// @lc code=start
+function inorderSuccessor(root: TreeNode, p: TreeNode): TreeNode | null {
+  if (p.right) {
+    return findLeftMost(p.right)
+  }
+
+  let curr = root
+  const path = []
+
+  while (curr !== p) {
+    path.push(curr)
+
+    if (curr.val > p.val) {
+      curr = curr.left!
+    } else {
+      curr = curr.right!
+    }
+  }
+
+  let end = p
+  while (path.length && path[path.length - 1].right === end) {
+    end = path.pop()!
+  }
+
+  if (path.length && path[path.length - 1].left === end) {
+    return path[path.length - 1]
+  }
+
+  return null
+}
+
+function findLeftMost(node: TreeNode | null) {
+  let curr = node
+  while (curr && curr.left) {
+    curr = curr.left
+  }
+  return curr
+}
+// @lc code=end

package.json

@@ -7,6 +7,7 @@
   "license": "MIT",
   "private": true,
   "dependencies": {
+    "@datastructures-js/priority-queue": "^5.3.0",
     "@types/jest": "^27.4.0",
     "jest": "^27.5.0",
     "ts-jest": "^27.1.3",

tests/10.正则表达式匹配.test.ts

@@ -0,0 +1,20 @@
+import { isMatch } from '../10.正则表达式匹配'
+
+describe('10.正则表达式匹配', () => {
+  it('should work', () => {
+    expect(isMatch('aa', 'a'))
+      .toBe(false)
+    expect(isMatch('aa', 'a*'))
+      .toBe(true)
+    expect(isMatch('ab', '.*'))
+      .toBe(true)
+    expect(isMatch('aaaaabaaaa', 'a*'))
+      .toBe(false)
+    expect(isMatch('aavaaaaaaaa', 'a..a*'))
+      .toBe(true)
+    expect(isMatch('', 'a*.*a*b*'))
+      .toBe(true)
+    expect(isMatch('ab', '.*'))
+      .toBe(true)
+  })
+})

tests/23.合并k个升序链表.test.ts

@@ -0,0 +1,19 @@
+import { mergeKLists } from '../23.合并k个升序链表'
+import { ListNode } from '../commons/list'
+
+describe('23.合并k个升序链表', () => {
+  it('should work', () => {
+    let nodes: Array<ListNode | null>
+
+    nodes = [[1, 4, 5], [1, 3, 4], [2, 6]].map((x) => ListNode.fromArray(x))
+    mergeKLists(nodes)
+    expect(nodes[0]?.toString())
+      .toBe(ListNode.fromArray([1, 1, 2, 3, 4, 4, 5, 6])!.toString())
+
+    nodes = []
+    expect(() => mergeKLists(nodes)).not.toThrow()
+
+    nodes = [null]
+    expect(() => mergeKLists(nodes)).not.toThrow()
+  })
+})

tests/285.二叉搜索树中的中序后继.test.ts

@@ -0,0 +1,29 @@
+import { inorderSuccessor } from '../285.二叉搜索树中的中序后继'
+import { TreeNode } from '../commons/Tree'
+
+describe('285.二叉搜索树中的中序后继', () => {
+  it('should work', () => {
+    let root: TreeNode
+    let node: TreeNode
+    let result: TreeNode
+
+    root = TreeNode.fromArray([41, 37, 44, 24, 39, 42, 48, 1, 35, 38, 40, null, 43, 46, 49, 0, 2, 30, 36, null, null, null, null, null, null, 45, 47, null, null, null, null, null, 4, 29, 32, null, null, null, null, null, null, 3, 9, 26, null, 31, 34, null, null, 7, 11, 25, 27, null, null, 33, null, 6, 8, 10, 16, null, null, null, 28, null, null, 5, null, null, null, null, null, 15, 19, null, null, null, null, 12, null, 18, 20, null, 13, 17, null, null, 22, null, 14, null, null, 21, 23])!
+    node = root.left!.right!.right!
+    result = root
+    expect(inorderSuccessor(root, node)).toBe(result)
+
+    root = TreeNode.fromArray([8, 5, 9, 3, 7])!
+    node = root.left!.right!
+    result = root
+    expect(inorderSuccessor(root, node)).toBe(result)
+
+    root = TreeNode.fromArray([2, 1, 3])!
+    node = root.left!
+    result = root
+    expect(inorderSuccessor(root, node)).toBe(result)
+
+    root = TreeNode.fromArray([5, 3, 6, 2, 4, null, null, 1])!
+    node = root.right!
+    expect(inorderSuccessor(root, node)).toBeNull()
+  })
+})

tsconfig.json

@@ -4,7 +4,7 @@
         /* Specify ECMAScript target version: 'ES3' (default), 'ES5', 'ES2015', 'ES2016', 'ES2017', 'ES2018', 'ES2019', 'ES2020', or 'ESNEXT'. */
         "module": "commonjs",
         /* Specify module code generation: 'none', 'commonjs', 'amd', 'system', 'umd', 'es2015', 'es2020', or 'ESNext'. */
-        // "allowJs": true,                             /* Allow javascript files to be compiled. */
+        "allowJs": true,                             /* Allow javascript files to be compiled. */
         // "checkJs": true,                             /* Report errors in .js files. */
         // "jsx": "preserve",                           /* Specify JSX code generation: 'preserve', 'react-native', 'react', 'react-jsx' or 'react-jsxdev'. */
         // "declaration": true,                         /* Generates corresponding '.d.ts' file. */

yarn.lock

@@ -305,6 +305,18 @@
   dependencies:
     "@cspotcode/source-map-consumer" "0.8.0"
 
+"@datastructures-js/heap@^3.2.0":
+  version "3.2.0"
+  resolved "https://registry.npmmirror.com/@datastructures-js/heap/-/heap-3.2.0.tgz#d8fcdbf58c462c8a3f0fdfd9c6a57ca11505321e"
+  integrity sha512-FcU5ZAyb+VIOZz1HABsJUsbJi2ZyUDO7aoe97hq4d3tK3z8nMgwdxf5bO0gafR0ExFi18YTspntqHLzt4XOgnA==
+
+"@datastructures-js/priority-queue@^5.3.0":
+  version "5.3.0"
+  resolved "https://registry.npmmirror.com/@datastructures-js/priority-queue/-/priority-queue-5.3.0.tgz#89afce79a19a3226c12cc6e9288f94ff60af26cf"
+  integrity sha512-0Dl0UooE9Uzz85qBP46HTjQHS5GN7NMNluN5/nMfxQAndG/1eNBJpBntLGT5QJarvMO3poLNBJzA3S4GPajp+w==
+  dependencies:
+    "@datastructures-js/heap" "^3.2.0"
+
 "@eslint/eslintrc@^1.1.0":
   version "1.1.0"
   resolved "https://registry.npmmirror.com/@eslint/eslintrc/-/eslintrc-1.1.0.tgz#583d12dbec5d4f22f333f9669f7d0b7c7815b4d3"