将数组拆分为不同大小的块(4、3、3、3、4、3、3、3 等) [英] Split array into different size chunks (4, 3, 3, 3, 4, 3, 3, 3, etc)

问题描述

我有一个这样的数组:[1, 2, 3, 4, 5, 6, 7, 9, 10].我需要将它分成不同大小的块，但使用简单的模式:4, 3, 3, 3, 4, 3, 3, 3 像这样:

<预><代码>[[//四1、2、3、4],[//三 (1/3)5、6、7],[//三 (2/3)8、9、10],[//三 (3/3)11、12、13],[//四14、15、16、17],[//三 (1/3)18、19、20]，//等等..]

我已尝试使用我自定义的此代码:

const arr;//我的值数组const chunked = arr.reduce((acc, product, i) => {如果(我％3){返回acc；} else if (!didFourWayReduce) {didFourWayReduce = true;FourWayReduces++;if ((fourWayReduces - 1) % 2) {//只让每一秒成为4 行"返回 [...acc, arr.slice(i, i + 3)];} 别的 {返回 [...acc, arr.slice(i, i + 4)];}} 别的 {didFourWayReduce = false;返回 [...acc, arr.slice(i, i + 3)];}}, []);

它几乎可以工作，期望第一个三元组 (1/3) 的最后一个元素为 4.因此，每个三元组的第一个块重复 1 个键.像这样:

<预><代码>[[1、2、3、4],[4,//这个是重复的，应该不是5、6]]

解决方案

您可以采用两个索引，一个用于数据数组，一个用于大小.然后按照给定的长度对数组进行切片并将块推送到块数组中.

继续直到数据结束.

var data = Array.from({ length: 26 }, (_, i) => i + 1),尺寸 = [4, 3, 3, 3],我 = 0,j = 0,块 = [];while (i < data.length) chunks.push(data.slice(i, i += size[j++ % sizes.length]));console.log(chunks);

.as-console-wrapper { max-height: 100% !important;顶部:0；}

I have an array like so: [1, 2, 3, 4, 5, 6, 7, 9, 10]. I need to chunk it into different size chunks, yet with a simple pattern of: 4, 3, 3, 3, 4, 3, 3, 3 like so:

[
    [ // four
        1,
        2,
        3,
        4
    ],
    [ // three (1/3)
        5,
        6,
        7
    ],
    [ // three (2/3)
        8,
        9,
        10
    ],
    [ // three (3/3)
        11,
        12,
        13
    ],
    [ // four
        14,
        15,
        16,
        17
    ],
    [ // three (1/3)
        18,
        19,
        20
    ], // and so on..
]

I have tried with this code I have customized:

const arr; // my array of values
const chuncked = arr.reduce((acc, product, i) => {
    if (i % 3) {
        return acc;
    } else if (!didFourWayReduce) {
        didFourWayReduce = true;
        fourWayReduces++;

        if ((fourWayReduces - 1) % 2) { // only make every second a "4 row"
            return [...acc, arr.slice(i, i + 3)];
        } else {
            return [...acc, arr.slice(i, i + 4)];
        }
    } else {
        didFourWayReduce = false;
        return [...acc, arr.slice(i, i + 3)];
    }
}, []);

And it works, almost, expect that the first chunk of threes (1/3) have the last element of the chunk with 4. So 1 key is repeated every first chunk of three. Like so:

[
    [
        1,
        2,
        3,
        4
    ],
    [
        4, // this one is repeated, and it shouldn't be
        5,
        6
    ]
]

解决方案

You could take two indices, one for the data array and one for sizes. Then slice the array with a given length and push the chunk to the chunks array.

Proceed until end of data.

var data = Array.from({ length: 26 }, (_, i) => i + 1),
    sizes = [4, 3, 3, 3],
    i = 0,
    j = 0,
    chunks = [];

while (i < data.length) chunks.push(data.slice(i, i += sizes[j++ % sizes.length]));

console.log(chunks);

.as-console-wrapper { max-height: 100% !important; top: 0; }

这篇关于将数组拆分为不同大小的块(4、3、3、3、4、3、3、3 等)的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！