LeetCode //2649. Nested Array Generator (Day 30 of LC JavaScript Challenage)-Toy模板网

这篇具有很好参考价值的文章主要介绍了LeetCode //2649. Nested Array Generator (Day 30 of LC JavaScript Challenage)。希望对大家有所帮助。如果存在错误或未考虑完全的地方，请大家不吝赐教，您也可以点击"举报违法"按钮提交疑问。

2649. Nested Array Generator

Given a multi-dimensional array of integers, return a generator object which yields integers in the same order as inorder traversal.

A multi-dimensional array is a recursive data structure that contains both integers and other multi-dimensional arrays.

inorder traversal iterates over each array from left to right, yielding any integers it encounters or applying inorder traversal to any arrays it encounters.

Example 1:

Input: arr = [[[6]],[1,3],[]]
Output: [6,1,3]
Explanation:
const generator = inorderTraversal(arr);
generator.next().value; // 6
generator.next().value; // 1
generator.next().value; // 3
generator.next().done; // true

Example 2:

Input: arr = []
Output: []
Explanation: There are no integers so the generator doesn’t yield anything.

Constraints:

$0 <= arr.flat().length <= 10^5$
$0 <= arr.flat()[i] <= 10^5$
$maxNestingDepth <= 10^5$

From: LeetCode
Link: 2649. Nested Array Generator文章来源地址https://www.toymoban.com/news/detail-474351.html

Solution:

Ideas：

The idea behind this code is to use a generator function to traverse a nested array. A generator function is a function that can be used to produce a sequence of values without actually storing all of the values in memory. This can be useful for large data sets, as it prevents the entire data set from being loaded into memory at once.

The inorderTraversal function works by recursively traversing the array. The recursive function checks if the current element is an array. If it is, it calls itself recursively to traverse the array. If it is not, it yields the element. This process continues until the entire array has been traversed.

Code:

/**
 * @param {Array} arr
 * @return {Generator}
 */
var inorderTraversal = function*(arr) {
    while (arr.length) {
    const current = arr.shift();

    if (Array.isArray(current)) {
      yield* inorderTraversal(current);
    } else {
      yield current;
    }
  }
};

/**
 * const gen = inorderTraversal([1, [2, 3]]);
 * gen.next().value; // 1
 * gen.next().value; // 2
 * gen.next().value; // 3
 */

到了这里，关于LeetCode //2649. Nested Array Generator (Day 30 of LC JavaScript Challenage)的文章就介绍完了。如果您还想了解更多内容，请在右上角搜索TOY模板网以前的文章或继续浏览下面的相关文章，希望大家以后多多支持TOY模板网！