在这种情况下，我们可以在多维数组中使用递归来推送新值吗?

Question

如何在每个数组中推送新值，container水果容器是否<我们想要的目标，>

例：

- we should push new fruits in those 2d arrays:
 - List item
 - the  maximun "apple" in container must has 3 fruits,
more than it, we should push to new array/index  in next 2d array container
 - the  maximun "mango" in container must has 2 fruits,
more than it, we should push to new array/index in next 2d array container
 - the  maximun "stawberry" in container must has 4 next fruits,
more than it, we should push to new array/index in next 2d array container

const stawberry = x => {
     return x.filter(el => el === "stawberry").length;
  }
const apple = x => {
     return x.filter(el => el === "apple").length;
  }
const mango = x => {
     return x.filter(el => el === "mango").length;
  }
const fruits = kindOfFruits => {
  if(kindOfFruits.length === 0){
    return [];
  } else if(stawberry(kindOfFruits[0]) === 0 ){
    kindOfFruits[0].push("NEW STAWBERRY");
  }
  return kindOfFruits.concat((fruits(kindOfFruits.slice(1))));
}
const container = [
  ["apple", "apple", "banana", "mango", "stawberry", "banana", "banana"],
  ["banana", "mango", "stawberry", "stawberry"],
  ["apple", "mango", "mango"]
];
console.log(fruits(container));

我想要这样的结果：

[
  ["apple", "apple", "banana", "mango", "stawberry", "banana", "banana", "apple", "mango", "stawberry ", "stawberry", "stawberry"],
  ["banana", "mango", "stawberry", "stawberry", "apple", "apple" , "stawberry"],
  ["apple", "mango", "mango"]
];

注意：我们推的时候水果不分类也没关系，只要容器里的水果和我们想推:D一样，

数据容器已经做好了，我们只需要把水果放在每个容器2D数组中，就像我说的上面的规则

我希望我的问题有意义，如果没有，对不起

Answer 1

我认为

您的问题中存在很大差距，没有定义任何目标或容器中将有多少种"水果"等。

正如我从您的问题中了解到的那样，您希望在目标上完全填充二维数组。所以我怀疑一些代码：

    var appleTarget = 5;
    var mangoTarget = 7;
    var strawberryTarget = 12;
    var kindOfFruit = ["apple", "mango", "strawberry"];
    function fruitCount(subFruitContainer, fruit)
    {
        return subFruitContainer.filter(el => el === fruit).length;
    }
    function insertFruit(dimension , fruit)
    {
        dimension.push(fruit);
    }
    function stableContainer(fruitContainer)
    {
        var selectedTarget;
        kindOfFruit.forEach(function(fruitKind) {
            fruitContainer.forEach(function(dimension){
                if(fruitKind == "apple") selectedTarget = appleTarget;
                else if(fruitKind == "mango") selectedTarget = mangoTarget;
                else if(fruitKind == "strawberry")  selectedTarget = strawberryTarget;
                else selectedTarget = 0;
                var fruitKindCount = fruitCount(dimension, fruitKind);
                if(fruitKindCount < selectedTarget) 
                {
                    for(var i = selectedTarget-fruitKindCount; i > 0; i--) 
                    {
                        insertFruit(dimension, fruitKind);
                    }
                }
            });
        });
        console.log("stabled container");
        console.log(fruitContainer);
    }
    var container = [
        ["apple", "apple", "banana", "mango", "stawberry", "banana", "banana"],
        ["banana", "mango", "stawberry", "stawberry"],
        ["apple", "mango", "mango"]
    ];
    stableContainer(container);

Answer 2

一种通过查找与新项目相同的项目的方法，根据所需的最大值进行计数和测试，然后推送到实际索引（如果计数较小）或下一个项目（如果在开始时或大于所需计数）。

此方法采用一个包含项的数组，并通过查找container情况来添加每个项。

function addFruit(fruit) {
    const 
        addFruits = (s, v) => s + +(v === fruit),
        max = { apple: 3, mango: 2, stawberry: 4, default: Infinity };
    var i = 0;
    while (i < container.length) {
        if (container[i].reduce(addFruits, 0) < (max[fruit] || max.default)) break;
        i++;
    }
    container[i] = container[i] || [];
    container[i].push(fruit);
}
var data = ["apple", "apple", "mango", "stawberry", "banana", "mango", "stawberry", "banana", "apple", "apple", "stawberry", "banana", "apple", "mango", "stawberry", "stawberry", "stawberry", "banana", "stawberry"],
    container = [];
data.forEach(addFruit);
console.log(container);

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