mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
55 lines
2.5 KiB
HTML
55 lines
2.5 KiB
HTML
<p>Write a function that accepts a <strong>multi-dimensional</strong> array <code>arr</code> and a depth <code>n</code>, and returns a <strong>flattened</strong> version of that array.</p>
|
|
|
|
|
|
|
|
<p>A <strong>multi-dimensional</strong> array is a recursive data structure that contains integers or other <strong>multi-dimensional</strong> arrays.</p>
|
|
|
|
|
|
|
|
<p>A <strong>flattened</strong> array is a version of that array with some or all of the sub-arrays removed and replaced with the actual elements in that sub-array. This flattening operation should only be done if the current depth of nesting is greater than <code>n</code>. The depth of the elements in the first array are considered to be 0.</p>
|
|
|
|
|
|
|
|
<p>Please solve it without the built-in <code>Array.flat</code> method.</p>
|
|
|
|
|
|
|
|
<p> </p>
|
|
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
<strong>Input</strong>
|
|
|
|
arr = [1, 2, 3, [4, 5, 6], [7, 8, [9, 10, 11], 12], [13, 14, 15]]
|
|
|
|
n = 0
|
|
|
|
<strong>Output</strong>
|
|
|
|
[1, 2, 3, [4, 5, 6], [7, 8, [9, 10, 11], 12], [13, 14, 15]]
|
|
|
|
|
|
|
|
<strong>Explanation</strong>
|
|
|
|
Passing a depth of n=0 will always result in the original array. This is because the smallest possible depth of a subarray (0) is not less than n=0. Thus, no subarray should be flattened. </pre>
|
|
|
|
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
<strong>Input</strong>
|
|
|
|
arr = [1, 2, 3, [4, 5, 6], [7, 8, [9, 10, 11], 12], [13, 14, 15]]
|
|
|
|
n = 1
|
|
|
|
<strong>Output</strong>
|
|
|
|
[1, 2, 3, 4, 5, 6, 7, 8, [9, 10, 11], 12, 13, 14, 15]
|
|
|
|
|
|
|
|
<strong>Explanation</strong>
|
|
|
|
The subarrays starting with 4, 7, and 13 are all flattened. This is because their depth of 0 is less than 1. However [9, 10, 11] remains unflattened because its depth is 1.</pre>
|
|
|
|
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
|
|
|
|
<pre>
|
|
|
|
<strong>Input</strong>
|
|
|
|
arr = [[1, 2, 3], [4, 5, 6], [7, 8, [9, 10, 11], 12], [13, 14, 15]]
|
|
|
|
n = 2
|
|
|
|
<strong>Output</strong>
|
|
|
|
[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15]
|
|
|
|
|
|
|
|
<strong>Explanation</strong>
|
|
|
|
The maximum depth of any subarray is 1. Thus, all of them are flattened.</pre>
|
|
|
|
|
|
|
|
<p> </p>
|
|
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
|
|
|
|
<ul>
|
|
|
|
<li><code>0 <= count of numbers in arr <= 10<sup>5</sup></code></li>
|
|
|
|
<li><code>0 <= count of subarrays in arr <= 10<sup>5</sup></code></li>
|
|
|
|
<li><code>maxDepth <= 1000</code></li>
|
|
|
|
<li><code>-1000 <= each number <= 1000</code></li>
|
|
|
|
<li><code><font face="monospace">0 <= n <= 1000</font></code></li>
|
|
|
|
</ul> |