在指定约束范围内使用随机数量填充数据集

对不起，你的代码对我来说太难处理了。根据您的条件，我编写了以下代码：

<?php
// Remapped your variables because it was too much
$constraints = [
    'wicket_keeper' => ['min' => 1, 'max' => 3],
    'batsman'       => ['min' => 3, 'max' => 5],
    'all_rounders'  => ['min' => 1, 'max' => 5],
    'bowlers'       => ['min' => 2, 'max' => 4],
];

// These are the current values to assign
$values = [
    'wicket_keeper' => 2,
    'batsman'       => 6,
    'all_rounders'  => 5,
    'bowlers'       => 5,
];

// The first problem is that the maximums should be adjusted to the values we have
foreach ($values as $key => $value) {
    if ($value < $constraints[$key]['max']){
        $constraints[$key]['max'] = $value;
    }
}

// Vice versa we need to do this for the minimums
// I now did this manually, but I think you get the point
$result = [
    'wicket_keeper' => 1,
    'batsman'       => 3,
    'all_rounders'  => 1,
    'bowlers'       => 2,
];

// We keep track of possible options
$options = array_keys($result);

// Init
$totalPlayers = 0;
$max = 0;

// This is minus 7 because of your minimum requirements, also done manually
// But of course you can calculate this as well.
$teamLimit = 11 - 7;
while($totalPlayers < $teamLimit) {
        // Pick a random type
        $random = rand(0, count($options) - 1);

        // Get key
        $key = $options[$random];

        // Add one player to the random type
        $result[$key] += 1;
        $totalPlayers++;

        // Check if max is reached
        // If so, remove it from possible options
        if ($result[$key] >= $constraints[$key]['max']){
            unset($options[$key]);
        }
}

var_dump($result);

我希望评论足够清楚。

现场示例

您可以将此脚本构建为单个函数/方法，或者更好的做法是实践单一责任原则，并具有多个函数/方法，这些函数/方法只执行一项任务。为了避免过多地扩展代码段，我将仅将我的建议显示为多责任函数。

• 传入团队创建设置。
• 实现逻辑防护条件，以便在设置阻止填充整个团队时提醒你。
• 对玩家总数应用最大限制。
• 作为捷径，为您的团队提供所有指定的最小值。
• 在循环中一次随机选择一个仓位，并在池中“消耗”该仓位，这样仓位就不会从池中超额抽取。
• 当团队已满或池为空时，终止循环。
• 返回已填充的团队，或在团队无法完全填充时提醒用户。

代码：（演示)

function randomizeTeam(
    int $teamSize,
    array $positionPool,
    array $positionMins = [],
    array $positionMaxs = []
): array {
    // guard conditions
    foreach ($positionMins as $pos => $min) {
        if (!key_exists($pos, $positionPool) || $positionPool[$pos] < $min) {
            throw new Exception('Position pool cannot accommodate minimum required positions');
        }
    }

    // input preparation
    foreach ($positionMaxs as $pos => $max) {
        if (key_exists($pos, $positionPool) && $positionPool[$pos] > $max) {
            $positionPool[$pos] = $max;
        }
    }
    
    // seed team
    $team = [];
    $sum = 0;
    foreach ($positionPool as $pos => &$pool) {
        $team[$pos] = $positionMins[$pos] ?? 0;
        $pool -= $team[$pos];
        if (!$pool) {
            unset($positionPool[$pos]); // remove exhausted pool
        }
        $sum += $team[$pos];
    }
    
    // add random positions
    while ($sum < $teamSize && $positionPool) {
        $pos = array_rand($positionPool);
        ++$team[$pos];
        --$positionPool[$pos];
        if (!$positionPool[$pos]) {
            unset($positionPool[$pos]); // remove exhausted pool
        }
        ++$sum;
    }

    // another guard condition
    if (array_sum($team) < $teamSize) {
        throw new Exception('Position pool was exhausted before filling team');
    }

    return $team;
}

var_export(
    randomizeTeam(
        11,
        [
            'wicket_keeper' => 2,
            'batsman'       => 6,
            'all_rounders'  => 5,
            'bowlers'       => 5,
        ],
        [
            'wicket_keeper' => 1,
            'batsman'       => 3,
            'all_rounders'  => 1,
            'bowlers'       => 2,
        ],
        [
            'wicket_keeper' => 3,
            'batsman'       => 5,
            'all_rounders'  => 5,
            'bowlers'       => 4,
        ]
    )
);

潜在输出：

array (
  'wicket_keeper' => 2,
  'batsman' => 4,
  'all_rounders' => 2,
  'bowlers' => 3,
)

一些附加说明：

• 最好以数组形式声明输入数据，这样您就可以享受循环和数组函数的动态优势，同时避免变量。
• 上述脚本旨在允许可扩展的仓位池，并允许最小和/或最大仓位约束，这些约束不需要提及主池中的所有仓位。