递归索引任意嵌套的片/数组

function recursiveIndex(array, target) {
    for (let i = 0; i < array.length; i++) {
        if (Array.isArray(array[i])) {
            const result = recursiveIndex(array[i], target);
            if (result !== null) {
                return [i, ...result];
            }
        } else if (array[i] === target) {
            return [i];
        }
    }
    return null;
}

// 示例用法
const nestedArray = [1, [2, [3, 4], 5], 6];
const target = 3;
const result = recursiveIndex(nestedArray, target);
console.log(result); // 输出: [1, 1, 0]

function iterativeIndex(array, target) {
    const stack = [{ array, path: [] }];

    while (stack.length > 0) {
        const { array, path } = stack.pop();

        for (let i = 0; i < array.length; i++) {
            const currentPath = [...path, i];
            if (Array.isArray(array[i])) {
                stack.push({ array: array[i], path: currentPath });
            } else if (array[i] === target) {
                return currentPath;
            }
        }
    }

    return null;
}

// 示例用法
const nestedArray = [1, [2, [3, 4], 5], 6];
const target = 3;
const result = iterativeIndex(nestedArray, target);
console.log(result); // 输出: [1, 1, 0]