feat: add solutions to lc problems: No.2648~2654

* No.2648.Generate Fibonacci Sequence
* No.2649.Nested Array Generator
* No.2650.Design Cancellable Function
* No.2651.Calculate Delayed Arrival Time
* No.2652.Sum Multiples
* No.2653.Sliding Subarray Beauty
* No.2654.Minimum Number of Operations to Make All Array Elements Equal
  to 1

Author: yanglbme

solution/2600-2699/2624.Snail Traversal/README.md

@@ -6,7 +6,7 @@
 
 <!-- 这里写题目描述 -->
 
-<p>请你编写一段代码为所有数组实现&nbsp;&nbsp;<code>snail(rowsCount，colsCount)</code> 方法，该方法将 1D 数组转换为以蜗牛排序的模式的 2D 数组。无效的输入值应该输出一个空数组。当 <code>rowsCount * colsCount&nbsp;!==</code><code>nums</code>&nbsp;时。这个输入被认为是无效的。</p>
+<p>请你编写一段代码为所有数组实现&nbsp;&nbsp;<code>snail(rowsCount，colsCount)</code> 方法，该方法将 1D 数组转换为以蜗牛排序的模式的 2D 数组。无效的输入值应该输出一个空数组。当 <code>rowsCount * colsCount&nbsp;!==</code><code>nums.length</code>&nbsp;时。这个输入被认为是无效的。</p>
 
 <p>蜗牛排序从左上角的单元格开始，从当前数组的第一个值开始。然后，它从上到下遍历第一列，接着移动到右边的下一列，并从下到上遍历它。将这种模式持续下去，每列交替变换遍历方向，直到覆盖整个数组。例如，当给定输入数组&nbsp;&nbsp;<code>[19, 10, 3, 7, 9, 8, 5, 2, 1, 17, 16, 14, 12, 18, 6, 13, 11, 20, 4, 15]</code> ，当 <code>rowsCount = 5</code>&nbsp;且&nbsp;<code>colsCount = 4</code> 时，需要输出矩阵如下图所示。注意，矩阵沿箭头方向对应于原数组中数字的顺序</p>
 

solution/2600-2699/2624.Snail Traversal/README_EN.md

@@ -6,7 +6,7 @@
 
 <p>Write code that enhances all arrays such that you can call the <code>snail(rowsCount, colsCount)</code> method that transforms the 1D&nbsp;array into&nbsp;a 2D array organised in&nbsp;the pattern known as <strong>snail traversal order</strong>. Invalid input values should output an empty array. If&nbsp;<code>rowsCount * colsCount !== nums.length</code>,&nbsp;the input is considered invalid.</p>
 
-<p><strong>Snail traversal order</strong><em>&nbsp;</em>starts at the top left cell with the first value of the current array. It then moves through the entire first column from top to bottom, followed by moving to the next column on the right and traversing it from bottom to top. This pattern continues, alternating the direction of traversal with each column, until the entire current array is covered. For example, when given the input array&nbsp;[19, 10, 3, 7, 9, 8, 5, 2, 1, 17, 16, 14, 12, 18, 6, 13, 11, 20, 4, 15]<code> </code>with <code>rowsCount = 5</code> and <code>colsCount = 4</code>,&nbsp;the desired output matrix is shown below. Note that iterating the matrix following the arrows corresponds to the order of numbers in the original array.</p>
+<p><strong>Snail traversal order</strong><em>&nbsp;</em>starts at the top left cell with the first value of the current array. It then moves through the entire first column from top to bottom, followed by moving to the next column on the right and traversing it from bottom to top. This pattern continues, alternating the direction of traversal with each column, until the entire current array is covered. For example, when given the input array&nbsp;<code>[19, 10, 3, 7, 9, 8, 5, 2, 1, 17, 16, 14, 12, 18, 6, 13, 11, 20, 4, 15]</code> with <code>rowsCount = 5</code> and <code>colsCount = 4</code>,&nbsp;the desired output matrix is shown below. Note that iterating the matrix following the arrows corresponds to the order of numbers in the original array.</p>
 
 <p>&nbsp;</p>
 

solution/2600-2699/2633.Convert Object to JSON String/README_EN.md

@@ -51,6 +51,7 @@ Primitive types are valid inputs.</pre>
 	<li><code>object includes strings, integers, booleans, arrays, objects, and null</code></li>
 	<li><code>1 &lt;= JSON.stringify(object).length &lt;= 10<sup>5</sup></code></li>
 	<li><code>maxNestingLevel &lt;= 1000</code></li>
+	<li><code>all strings will only contain alphanumeric characters</code></li>
 </ul>
 
 ## Solutions

solution/2600-2699/2648.Generate Fibonacci Sequence/README.md

@@ -0,0 +1,78 @@
+# [2648. 生成斐波那契数列](https://leetcode.cn/problems/generate-fibonacci-sequence)
+
+[English Version](/solution/2600-2699/2648.Generate%20Fibonacci%20Sequence/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>请你编写一个生成器函数，并返回一个可以生成 <strong>斐波那契数列</strong> 的生成器对象。</p>
+
+<p><strong>斐波那契数列</strong> 的递推公式为 <code>X<sub>n</sub>&nbsp;= X<sub>n-1</sub>&nbsp;+ X<sub>n-2</sub></code> 。</p>
+
+<p>这个数列的前几个数字是 <code>0, 1, 1, 2, 3, 5, 8, 13</code>&nbsp;。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>callCount = 5
+<b>输出：</b>[0,1,1,2,3]
+<strong>解释：</strong>
+const gen = fibGenerator();
+gen.next().value; // 0
+gen.next().value; // 1
+gen.next().value; // 1
+gen.next().value; // 2
+gen.next().value; // 3
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<b>输入：</b>callCount = 0
+<strong>输出：</strong>[]
+<b>解释：</b>gen.next() 永远不会被调用，所以什么也不会输出
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>0 &lt;= callCount &lt;= 50</code></li>
+</ul>
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **TypeScript**
+
+```ts
+function* fibGenerator(): Generator<number, any, number> {
+    let a = 0;
+    let b = 1;
+    while (true) {
+        yield a;
+        [a, b] = [b, a + b];
+    }
+}
+
+/**
+ * const gen = fibGenerator();
+ * gen.next().value; // 0
+ * gen.next().value; // 1
+ */
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2600-2699/2648.Generate Fibonacci Sequence/README_EN.md

@@ -0,0 +1,72 @@
+# [2648. Generate Fibonacci Sequence](https://leetcode.com/problems/generate-fibonacci-sequence)
+
+[中文文档](/solution/2600-2699/2648.Generate%20Fibonacci%20Sequence/README.md)
+
+## Description
+
+<p>Write a generator function that returns a generator object which yields the&nbsp;<strong>fibonacci sequence</strong>.</p>
+
+<p>The&nbsp;<strong>fibonacci sequence</strong>&nbsp;is defined by the relation <code>X<sub>n</sub>&nbsp;= X<sub>n-1</sub>&nbsp;+ X<sub>n-2</sub></code>.</p>
+
+<p>The first few numbers&nbsp;of the series are <code>0, 1, 1, 2, 3, 5, 8, 13</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> callCount = 5
+<strong>Output:</strong> [0,1,1,2,3]
+<strong>Explanation:</strong>
+const gen = fibGenerator();
+gen.next().value; // 0
+gen.next().value; // 1
+gen.next().value; // 1
+gen.next().value; // 2
+gen.next().value; // 3
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> callCount = 0
+<strong>Output:</strong> []
+<strong>Explanation:</strong> gen.next() is never called so nothing is outputted
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>0 &lt;= callCount &lt;= 50</code></li>
+</ul>
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **TypeScript**
+
+```ts
+function* fibGenerator(): Generator<number, any, number> {
+    let a = 0;
+    let b = 1;
+    while (true) {
+        yield a;
+        [a, b] = [b, a + b];
+    }
+}
+
+/**
+ * const gen = fibGenerator();
+ * gen.next().value; // 0
+ * gen.next().value; // 1
+ */
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2600-2699/2648.Generate Fibonacci Sequence/Solution.ts

@@ -0,0 +1,14 @@
+function* fibGenerator(): Generator<number, any, number> {
+    let a = 0;
+    let b = 1;
+    while (true) {
+        yield a;
+        [a, b] = [b, a + b];
+    }
+}
+
+/**
+ * const gen = fibGenerator();
+ * gen.next().value; // 0
+ * gen.next().value; // 1
+ */

solution/2600-2699/2649.Nested Array Generator/README.md

@@ -0,0 +1,85 @@
+# [2649. 嵌套数组生成器](https://leetcode.cn/problems/nested-array-generator)
+
+[English Version](/solution/2600-2699/2649.Nested%20Array%20Generator/README_EN.md)
+
+## 题目描述
+
+<!-- 这里写题目描述 -->
+
+<p>现给定一个整数的 <strong>多维数组</strong> ，请你返回一个生成器对象，按照&nbsp;<strong>中序遍历</strong> 的顺序逐个生成整数。</p>
+
+<p><strong>多维数组</strong> 是一个递归数据结构，包含整数和其他 <strong>多维数组</strong>。</p>
+
+<p><strong>中序遍历</strong> 是从左到右遍历每个数组，在遇到任何整数时生成它，遇到任何数组时递归应用 <strong>中序遍历</strong> 。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<b>输入：</b>arr = [[[6]],[1,3],[]]
+<b>输出：</b>[6,1,3]
+<strong>解释：</strong>
+const generator = inorderTraversal(arr);
+generator.next().value; // 6
+generator.next().value; // 1
+generator.next().value; // 3
+generator.next().done; // true
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<b>输入：</b>arr = []
+<b>输出：</b>[]
+<b>解释：</b>输入的多维数组没有任何参数，所以生成器不需要生成任何值。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>0 &lt;= arr.flat().length &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= arr.flat()[i]&nbsp;&lt;= 10<sup>5</sup></code></li>
+	<li><code>maxNestingDepth &lt;= 10<sup>5</sup></code></li>
+</ul>
+
+## 解法
+
+<!-- 这里可写通用的实现逻辑 -->
+
+<!-- tabs:start -->
+
+### **TypeScript**
+
+```ts
+type MultidimensionalArray = (MultidimensionalArray | number)[];
+
+function* inorderTraversal(
+    arr: MultidimensionalArray,
+): Generator<number, void, unknown> {
+    for (const e of arr) {
+        if (Array.isArray(e)) {
+            yield* inorderTraversal(e);
+        } else {
+            yield e;
+        }
+    }
+}
+
+/**
+ * const gen = inorderTraversal([1, [2, 3]]);
+ * gen.next().value; // 1
+ * gen.next().value; // 2
+ * gen.next().value; // 3
+ */
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2600-2699/2649.Nested Array Generator/README_EN.md

@@ -0,0 +1,79 @@
+# [2649. Nested Array Generator](https://leetcode.com/problems/nested-array-generator)
+
+[中文文档](/solution/2600-2699/2649.Nested%20Array%20Generator/README.md)
+
+## Description
+
+<p>Given a&nbsp;<strong>multi-dimensional array</strong> of integers, return&nbsp;a generator object which&nbsp;yields integers in the same order as&nbsp;<strong>inorder traversal</strong>.</p>
+
+<p>A&nbsp;<strong>multi-dimensional array</strong>&nbsp;is a recursive data structure that contains both integers and other&nbsp;<strong>multi-dimensional arrays</strong>.</p>
+
+<p><strong>inorder traversal</strong>&nbsp;iterates over&nbsp;each array from left to right, yielding any integers it encounters or applying&nbsp;<strong>inorder traversal</strong>&nbsp;to any arrays it encounters.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = [[[6]],[1,3],[]]
+<strong>Output:</strong> [6,1,3]
+<strong>Explanation:</strong>
+const generator = inorderTraversal(arr);
+generator.next().value; // 6
+generator.next().value; // 1
+generator.next().value; // 3
+generator.next().done; // true
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> arr = []
+<strong>Output:</strong> []
+<strong>Explanation:</strong> There are no integers so the generator doesn&#39;t yield anything.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>0 &lt;= arr.flat().length &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= arr.flat()[i]&nbsp;&lt;= 10<sup>5</sup></code></li>
+	<li><code>maxNestingDepth &lt;= 10<sup>5</sup></code></li>
+</ul>
+
+## Solutions
+
+<!-- tabs:start -->
+
+### **TypeScript**
+
+```ts
+type MultidimensionalArray = (MultidimensionalArray | number)[];
+
+function* inorderTraversal(
+    arr: MultidimensionalArray,
+): Generator<number, void, unknown> {
+    for (const e of arr) {
+        if (Array.isArray(e)) {
+            yield* inorderTraversal(e);
+        } else {
+            yield e;
+        }
+    }
+}
+
+/**
+ * const gen = inorderTraversal([1, [2, 3]]);
+ * gen.next().value; // 1
+ * gen.next().value; // 2
+ * gen.next().value; // 3
+ */
+```
+
+### **...**
+
+```
+
+```
+
+<!-- tabs:end -->

solution/2600-2699/2649.Nested Array Generator/Solution.ts

@@ -0,0 +1,20 @@
+type MultidimensionalArray = (MultidimensionalArray | number)[];
+
+function* inorderTraversal(
+    arr: MultidimensionalArray,
+): Generator<number, void, unknown> {
+    for (const e of arr) {
+        if (Array.isArray(e)) {
+            yield* inorderTraversal(e);
+        } else {
+            yield e;
+        }
+    }
+}
+
+/**
+ * const gen = inorderTraversal([1, [2, 3]]);
+ * gen.next().value; // 1
+ * gen.next().value; // 2
+ * gen.next().value; // 3
+ */