javascript - 计算数组中每 10 个对象的成功率

Question

我有以下数组，它可以包含多达 30 个对象，每个用户都是动态的。

const array = [
{name: x, succeeded: true},
{name: y, succeeded: false},
{name: z, succeeded: true},
]

我需要做的是创建一个函数，它将检查每 10 个对象的成功率，并添加一个名为“successRate”的键，其中最后 10 个对象的成功率取决于成功的时间是真的。如果剩下的对象少于 10 个，它将计算剩余对象数量的成功率（例如，如果数组中有 27 个对象，它将检查前 10 个的成功率，然后检查其他 10 个，然后检查 7 个）。

示例数组的输出应该是：

const array = [
{name: x, succeeded: true, successRate: 66.66%},
{name: y, succeeded: false, successRate: 66.66%},
{name: z, succeeded: true, successRate: 66.66%},
]

但是，如果数组的长度例如为 13，它将首先检查前 10 个对象并给予它们相同的成功率，然后检查其他 3 个对象并给予它们所有相同的成功率。 例如：

const array = [
{name: 1, succeeded: true, successRate: 80%},
{name: 2, succeeded: true, successRate: 80%},
{name: 3, succeeded: true, successRate: 80%},
{name: 4, succeeded: true, successRate: 80%},
{name: 5, succeeded: false, successRate: 80%},
{name: 6, succeeded: true, successRate: 80%},
{name: 7, succeeded: true, successRate: 80%},
{name: 8, succeeded: false, successRate: 80%},
{name: 9, succeeded: true, successRate: 80%},
{name: 10, succeeded: true, successRate: 80%},
{name: 11, succeeded: false, successRate: 66.66%},
{name: 12, succeeded: true, successRate: 66.66%},
{name: 13, succeeded: true, successRate: 66.66%},
]

Answer 1

这是一个使用递归来分块数组的解决方案...

const
  array = [{ name: 1 }, { name: 2, succeeded: true }, { name: 3, succeeded: true }, { name: 4, succeeded: true }, { name: 5, succeeded: false }, { name: 6, succeeded: true }, { name: 7, succeeded: true }, { name: 8, succeeded: false }, { name: 9, succeeded: true }, { name: 10, succeeded: true }, { name: 11, succeeded: false }, { name: 12, succeeded: true }, { name: 13, succeeded: true },],

  calculateSucessRate = (arr) => {
    const { sum, length } = arr.reduce((a, { succeeded }) => {
      if (succeeded !== undefined) {
        a.length += 1;
        a.sum += succeeded;
      }
      return a;
    }, { sum: 0, length: 0 });

    return sum / length;
  },

  successRateByChunk = (arr, chunkSize) => {
    if (!arr.length) { return []; }

    const chunk = arr.slice(0, chunkSize);
    const successRate = `${calculateSucessRate(chunk) * 100}%`;

    return [
      ...chunk.map(o => ({ ...o, successRate })),
      ...successRateByChunk(arr.slice(chunkSize), chunkSize)
    ];
  };

console.log(successRateByChunk(array, 10));

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

Answer 2

您可以执行以下操作：

const array = [
  {name: 1, succeeded: true,},
  {name: 2, succeeded: true},
  {name: 3, succeeded: true},
  {name: 4, succeeded: true},
  {name: 5, succeeded: false},
  {name: 6, succeeded: true},
  {name: 7, succeeded: true},
  {name: 8, succeeded: false},
  {name: 9, succeeded: true,},
  {name: 10, succeeded: true},
  {name: 11, succeeded: false},
  {name: 12, succeeded: true},
  {name: 13, succeeded: true},
]

const arrays = [];
const size = 10;
// first split input into chunks of 10 or less
for (let i = 0; i < array.length; i += size) {
   arrays.push(array.slice(i, i + size));
}

const result = arrays.forEach(chunk => { // do following for each chunk

   //find number of succeeded items
   let succeeded = chunk.filter(item => item.succeeded).length;

   // find success rate based on number of items in chunk
   let rate = `${(succeeded/chunk.length) * 100}%`;

   // add current success rate to every item in chunk
   chunk.forEach(item => item.successRate = rate);
});

console.log(arrays.flat());