feat: leetcode 1305

Author: ouduidui

README.md

@@ -2,7 +2,7 @@
 
 <p align="center">
 <!-- TOPICS COUNT START -->
-<img src="https://img.shields.io/badge/-进度:349-green" alt="进度:349">
+<img src="https://img.shields.io/badge/-进度:350-green" alt="进度:350">
 <!-- TOPICS COUNT END -->
 <a href="./assets/docs/TOPICS.md"><img src="https://img.shields.io/badge/-题库目录-blue" alt="题库目录"></a>
 <a href="./assets/docs/CATEGORIES.md"><img src="https://img.shields.io/badge/-题库分类-red" alt="题库分类"></a>

assets/data/categories.json

@@ -2450,6 +2450,12 @@
         "path": "./problemset/number-of-enclaves/README.md",
         "difficulty": "中等"
       },
+      {
+        "id": "1305",
+        "title": "两颗二叉搜索树中的所有元素",
+        "path": "./problemset/all-elements-in-two-binary-search-trees/README.md",
+        "difficulty": "中等"
+      },
       {
         "id": "1765",
         "title": "地图中的最高点",
@@ -2816,6 +2822,12 @@
         "title": "两数之和 IV - 输入 BST",
         "path": "./problemset/two-sum-iv-input-is-a-bst/README.md",
         "difficulty": "简单"
+      },
+      {
+        "id": "1305",
+        "title": "两颗二叉搜索树中的所有元素",
+        "path": "./problemset/all-elements-in-two-binary-search-trees/README.md",
+        "difficulty": "中等"
       }
     ]
   },

assets/data/topics.json

@@ -3179,6 +3179,16 @@
     "url": "https://leetcode-cn.com/problems/maximum-number-of-balloons/",
     "path": "./problemset/maximum-number-of-balloons/README.md"
   },
+  {
+    "id": "1305",
+    "title": {
+      "cn": "两颗二叉搜索树中的所有元素",
+      "en": "all-elements-in-two-binary-search-trees"
+    },
+    "difficulty": "中等",
+    "url": "https://leetcode-cn.com/problems/all-elements-in-two-binary-search-trees/",
+    "path": "./problemset/all-elements-in-two-binary-search-trees/README.md"
+  },
   {
     "id": "1342",
     "title": {

assets/docs/CATEGORIES.md

@@ -462,6 +462,7 @@
 | 653. [两数之和 IV - 输入 BST](../../problemset/two-sum-iv-input-is-a-bst/README.md) | 简单 |
 | 838. [推多米诺](../../problemset/push-dominoes/README.md) | 中等 |
 | 1020. [飞地的数量](../../problemset/number-of-enclaves/README.md) | 中等 |
+| 1305. [两颗二叉搜索树中的所有元素](../../problemset/all-elements-in-two-binary-search-trees/README.md) | 中等 |
 | 1765. [地图中的最高点](../../problemset/map-of-highest-peak/README.md) | 中等 |
 | 2039. [网络空闲的时刻](../../problemset/the-time-when-the-network-becomes-idle/README.md) | 中等 |
 | 2049. [统计最高分的节点数目](../../problemset/count-nodes-with-the-highest-score/README.md) | 中等 |
@@ -544,6 +545,7 @@
 | 589. [N 叉树的前序遍历](../../problemset/n-ary-tree-preorder-traversal/README.md) | 简单 |
 | 606. [根据二叉树创建字符串](../../problemset/construct-string-from-binary-tree/README.md) | 简单 |
 | 653. [两数之和 IV - 输入 BST](../../problemset/two-sum-iv-input-is-a-bst/README.md) | 简单 |
+| 1305. [两颗二叉搜索树中的所有元素](../../problemset/all-elements-in-two-binary-search-trees/README.md) | 中等 |
 
 ## 枚举
 

assets/docs/TOPICS.md

@@ -636,6 +636,8 @@
 
 [1189. “气球” 的最大数量](../../problemset/maximum-number-of-balloons/README.md)
 
+[1305. 两颗二叉搜索树中的所有元素](../../problemset/all-elements-in-two-binary-search-trees/README.md)
+
 [1342. 将数字变成 0 的操作次数](../../problemset/number-of-steps-to-reduce-a-number-to-zero/README.md)
 
 [1380. 矩阵中的幸运数](../../problemset/lucky-numbers-in-a-matrix/README.md)

problemset/all-elements-in-two-binary-search-trees/README.md

@@ -0,0 +1,63 @@
+# 两颗二叉搜索树中的所有元素
+
+> 难度：中等
+>
+> https://leetcode-cn.com/problems/all-elements-in-two-binary-search-trees/
+
+## 题目
+
+给你 `root1` 和 `root2` 这两棵二叉搜索树。请你返回一个列表，其中包含 **两棵树** 中的所有整数并按 **升序** 排序。
+
+### 示例
+
+#### 示例 1：
+
+![q2-e1](https://user-images.githubusercontent.com/54696834/166128218-4dfe62f5-b52e-48f3-84c4-100820db59ff.png)
+
+```
+输入：root1 = [2,1,4], root2 = [1,0,3]
+输出：[0,1,1,2,3,4]
+```
+
+#### 示例 2：
+
+![q2-e5-](https://user-images.githubusercontent.com/54696834/166128221-19759c30-7192-4854-ba7d-eb12855437d7.png)
+
+```
+输入：root1 = [1,null,8], root2 = [8,1]
+输出：[1,1,8,8]
+```
+
+## 解题
+
+```ts 
+/**
+ * 中序遍历 + 归并
+ * @desc 时间复杂度 O(M+N)  空间复杂度 O(M+N)
+ * @param root1
+ * @param root2
+ * @returns
+ */
+export function getAllElements(root1: TreeNode | null, root2: TreeNode | null): number[] {
+  const nums1: number[] = []
+  const nums2: number[] = []
+
+  inorder(root1, nums1)
+  inorder(root2, nums2)
+
+  const merged: number[] = []
+
+  while (nums1.length && nums2.length)
+    merged.push(nums1[0] <= nums2[0] ? nums1.shift()! : nums2.shift()!)
+
+  merged.push(...nums1, ...nums2)
+  return merged
+
+  function inorder(node: TreeNode | null, nums: number[]) {
+    if (!node) return
+    inorder(node.left, nums)
+    nums.push(node.val)
+    inorder(node.right, nums)
+  }
+}
+```

problemset/all-elements-in-two-binary-search-trees/index.spec.ts

@@ -0,0 +1,17 @@
+import { describe, expect, it } from 'vitest'
+import { getAllElements } from '.'
+import type { TreeNode } from '~/utils/treeNode'
+import { createTreeNode } from '~/utils/treeNode'
+
+describe('两颗二叉搜索树中的所有元素', () => {
+  testCase(getAllElements)
+})
+
+function testCase(fn: (root1: TreeNode | null, root2: TreeNode | null) => number[]) {
+  it.each([
+    [[2, 1, 4], [1, 0, 3], [0, 1, 1, 2, 3, 4]],
+    [[1, null, 8], [8, 1], [1, 1, 8, 8]],
+  ])('示例%#', (root1, root2, expected) => {
+    expect(fn(createTreeNode(root1), createTreeNode(root2))).toStrictEqual(expected)
+  })
+}

problemset/all-elements-in-two-binary-search-trees/index.ts

@@ -0,0 +1,31 @@
+import type { TreeNode } from '~/utils/treeNode'
+
+/**
+ * 中序遍历 + 归并
+ * @desc 时间复杂度 O(M+N)  空间复杂度 O(M+N)
+ * @param root1
+ * @param root2
+ * @returns
+ */
+export function getAllElements(root1: TreeNode | null, root2: TreeNode | null): number[] {
+  const nums1: number[] = []
+  const nums2: number[] = []
+
+  inorder(root1, nums1)
+  inorder(root2, nums2)
+
+  const merged: number[] = []
+
+  while (nums1.length && nums2.length)
+    merged.push(nums1[0] <= nums2[0] ? nums1.shift()! : nums2.shift()!)
+
+  merged.push(...nums1, ...nums2)
+  return merged
+
+  function inorder(node: TreeNode | null, nums: number[]) {
+    if (!node) return
+    inorder(node.left, nums)
+    nums.push(node.val)
+    inorder(node.right, nums)
+  }
+}