优化比赛序列生成算法：实现选手出战间隔控制

const data = [
  {"id":"1","fighter1":"paul","fighter2":"anna","fightNumber":1},
  {"id":"2","fighter1":"jack","fighter2":"paul","fightNumber":2}, // 问题：paul 连续出战
  {"id":"3","fighter1":"roger","fighter2":"law","fightNumber":3},
  // ... 其他比赛
];

const new_result= [
  {"id":"1","fighter1":"paul","fighter2":"anna","fightNumber":1},
  {"id":"3","fighter1":"roger","fighter2":"law","fightNumber":2},
  {"id":"7","fighter1":"lee","fighter2":"jack","fightNumber":3},
  {"id":"2","fighter1":"jack","fighter2":"paul","fightNumber":4}, // paul 在第1场和第4场之间有2场间隔 (3-1=2)
  // ...
];

// 用户原有代码片段（简化）
const dataGroupedByName = data.reduce(/* ...分组逻辑... */);
let result = [];
let i = 0;
while (true) {
  let done = true;
  for (const groupName in dataGroupedByName) {
    const group = dataGroupedByName[groupName];
    if (i < group.length) {
      const newItem = { ...group[i], fightNumber: String(result.length + 1) };
      // 这里的while循环只是为了避免fightNumber重复，而非控制间隔
      while (usedFightNumbers.has(newItem.fightNumber)) {
        newItem.fightNumber = String(parseInt(newItem.fightNumber) + 0.5);
      }
      result.push(newItem);
      usedFightNumbers.add(newItem.fightNumber);
      done = false;
    }
  }
  if (done) break;
  i++;
}

<label>选择选手出战的最小间隔场次：</label>
<select name="gap" id="gapNumberInput">
  <option value="1">1</option>
  <option value="2">2</option>
  <option value="3">3</option>
  <option value="4">4</option>
</select>
<br>
<button onclick="calculateFight()">生成比赛序列</button>

<br><br><br>
<p>注意：间隔数越大，符合条件的比赛组合越少，可能导致某些场次无法安排选手。</p>
<pre id="output"></pre>

const initialData = [
  { id: "1", fighter1: "paul", fighter2: "anna", fightNumber: null },
  { id: "2", fighter1: "jack", fighter2: "paul", fightNumber: null },
  { id: "3", fighter1: "roger", fighter2: "law", fightNumber: null },
  { id: "4", fighter1: "lee", fighter2: "law", fightNumber: null },
  { id: "5", fighter1: "law", fighter2: "paul", fightNumber: null },
  { id: "6", fighter1: "roger", fighter2: "anna", fightNumber: null },
  { id: "7", fighter1: "lee", fighter2: "jack", fightNumber: null },
  { id: "8", fighter1: "roger", fighter2: "anna", fightNumber: null },
  { id: "9", fighter1: "lee", fighter2: "jack", fightNumber: null },
];

function calculateFight() {
  // 获取用户选择的间隔数
  const gapNumber = parseInt(document.getElementById("gapNumberInput").value);
  // 存储每场比赛中出战的选手，用于判断疲劳状态
  const tiredFightersList = [];
  // 存储原始数据中哪些比赛已经被安排到新的序列中
  const compiledIndexes = [];

  // 复制一份数据，避免修改原始数据
  const dataToProcess = JSON.parse(JSON.stringify(initialData));

  // 遍历并生成新的比赛序列
  const fights = dataToProcess.map((element, index) => {    
    // 计算当前场次（index）之前，需要考虑的疲劳选手范围
    // slice(-gapNumber) 获取最近的 gapNumber 场比赛的出战选手
    const recentFightsForTiredness = tiredFightersList.slice(-gapNumber);

    // 汇总最近N场比赛中所有出战过的选手，作为当前场次的“疲劳选手”
    const tiredFighters = recentFightsForTiredness.reduce((prev, currFighters) => {
      if (currFighters) { // 确保 currFighters 不为空 (例如在序列开头)
        currFighters.forEach(fighter => {
          if (fighter && !prev.includes(fighter)) { // 避免重复添加和空值
            prev.push(fighter);
          }
        });
      }
      return prev;
    }, []);

    let searchIndex = 0;
    let foundMatch = null;

    // 循环查找合适的比赛：
    // 1. 选手不在疲劳列表中
    // 2. 该比赛尚未被安排
    while (searchIndex < dataToProcess.length) {
      const currentFightCandidate = dataToProcess[searchIndex];
      // 检查当前候选比赛的选手是否疲劳，或该比赛是否已安排
      const isFighter1Tired = tiredFighters.includes(currentFightCandidate?.fighter1);
      const isFighter2Tired = tiredFighters.includes(currentFightCandidate?.fighter2);
      const isAlreadyCompiled = compiledIndexes.includes(searchIndex);

      if (currentFightCandidate && !isFighter1Tired && !isFighter2Tired && !isAlreadyCompiled) {
        foundMatch = currentFightCandidate;
        break; // 找到合适的比赛，跳出循环
      }
      searchIndex += 1;
    }

    // 记录当前场次的出战选手，并标记该比赛已被安排
    if (foundMatch) {
      tiredFightersList[index] = [foundMatch.fighter1, foundMatch.fighter2];
      compiledIndexes.push(searchIndex); // 记录原始索引
      return {
        ...foundMatch,
        fightNumber: index + 1 // 比赛编号从1开始
      };
    } else {
      // 如果没有找到合适的比赛，则该场次可能为空
      tiredFightersList[index] = []; // 记录为空，避免影响后续疲劳计算
      return {
        id: null, // 或其他标识，表示该场次未能安排比赛
        fighter1: null,
        fighter2: null,
        fightNumber: index + 1
      };
    }
  });

  document.getElementById("output").textContent = JSON.stringify(fights, null, 2);
  console.log(fights);
}