From 6651e5a3a401528a508e202e8731e78ef2b81392 Mon Sep 17 00:00:00 2001 From: rain84 Date: Mon, 20 May 2024 01:44:33 +0300 Subject: [PATCH 1/2] refactor: update solution to lc problem: No.2625 --- solution/2600-2699/2625.Flatten Deeply Nested Array/README.md | 4 ++-- .../2600-2699/2625.Flatten Deeply Nested Array/README_EN.md | 4 ++-- .../2600-2699/2625.Flatten Deeply Nested Array/Solution.ts | 4 ++-- 3 files changed, 6 insertions(+), 6 deletions(-) diff --git a/solution/2600-2699/2625.Flatten Deeply Nested Array/README.md b/solution/2600-2699/2625.Flatten Deeply Nested Array/README.md index 74f1fa245dcac..60696e9349353 100644 --- a/solution/2600-2699/2625.Flatten Deeply Nested Array/README.md +++ b/solution/2600-2699/2625.Flatten Deeply Nested Array/README.md @@ -95,12 +95,12 @@ n = 2 type MultiDimensionalArray = (number | MultiDimensionalArray)[]; var flat = function (arr: MultiDimensionalArray, n: number): MultiDimensionalArray { - if (n <= 0) { + if (!n) { return arr; } const ans: MultiDimensionalArray = []; for (const x of arr) { - if (Array.isArray(x)) { + if (Array.isArray(x) && n) { ans.push(...flat(x, n - 1)); } else { ans.push(x); diff --git a/solution/2600-2699/2625.Flatten Deeply Nested Array/README_EN.md b/solution/2600-2699/2625.Flatten Deeply Nested Array/README_EN.md index c5beff0b8b0d9..fb0fee5f4726b 100644 --- a/solution/2600-2699/2625.Flatten Deeply Nested Array/README_EN.md +++ b/solution/2600-2699/2625.Flatten Deeply Nested Array/README_EN.md @@ -86,12 +86,12 @@ The maximum depth of any subarray is 1. Thus, all of them are flattened. type MultiDimensionalArray = (number | MultiDimensionalArray)[]; var flat = function (arr: MultiDimensionalArray, n: number): MultiDimensionalArray { - if (n <= 0) { + if (!n) { return arr; } const ans: MultiDimensionalArray = []; for (const x of arr) { - if (Array.isArray(x)) { + if (Array.isArray(x) && n) { ans.push(...flat(x, n - 1)); } else { ans.push(x); diff --git a/solution/2600-2699/2625.Flatten Deeply Nested Array/Solution.ts b/solution/2600-2699/2625.Flatten Deeply Nested Array/Solution.ts index b5be1c52304d9..c0031cc50cfb2 100644 --- a/solution/2600-2699/2625.Flatten Deeply Nested Array/Solution.ts +++ b/solution/2600-2699/2625.Flatten Deeply Nested Array/Solution.ts @@ -1,12 +1,12 @@ type MultiDimensionalArray = (number | MultiDimensionalArray)[]; var flat = function (arr: MultiDimensionalArray, n: number): MultiDimensionalArray { - if (n <= 0) { + if (!n) { return arr; } const ans: MultiDimensionalArray = []; for (const x of arr) { - if (Array.isArray(x)) { + if (Array.isArray(x) && n) { ans.push(...flat(x, n - 1)); } else { ans.push(x); From d7a0220bcd63a18b9ecac39abad306895bc0f4d7 Mon Sep 17 00:00:00 2001 From: Libin YANG Date: Mon, 20 May 2024 09:02:56 +0800 Subject: [PATCH 2/2] Update README.md --- solution/2600-2699/2625.Flatten Deeply Nested Array/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/solution/2600-2699/2625.Flatten Deeply Nested Array/README.md b/solution/2600-2699/2625.Flatten Deeply Nested Array/README.md index 60696e9349353..58614620dda1b 100644 --- a/solution/2600-2699/2625.Flatten Deeply Nested Array/README.md +++ b/solution/2600-2699/2625.Flatten Deeply Nested Array/README.md @@ -83,7 +83,7 @@ n = 2 我们可以使用递归的方法，将多维数组扁平化。 -在函数中，我们首先判断 $n$ 是否小于等于 $0$，如果是，直接返回原数组。否则，我们遍历数组的每个元素 $x$，如果 $x$ 是数组，我们递归调用函数，将 $x$ 作为参数，$n - 1$ 作为深度，将返回值添加到结果数组中；否则，将 $x$ 添加到结果数组中。最后返回结果数组。 +在函数中，我们首先判断 $n$ 是否小于等于 $0$，如果是，直接返回原数组。否则，我们遍历数组的每个元素 $x$，如果 $x$ 是数组，我们递归调用函数，参数为 $(x, n - 1)$，将返回值添加到结果数组中；否则，将 $x$ 添加到结果数组中。最后返回结果数组。 时间复杂度 $O(n)$，空间复杂度 $O(n)$。其中 $n$ 是数组的元素个数。