JavaScript格斗赛程编排：实现选手轮休间隔的动态算法设计

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},
  {"id":"4","fighter1":"lee","fighter2":"law","fightNumber":4},
  {"id":"5","fighter1":"law","fighter2":"paul","fightNumber":5}, // 错误：paul在短间隔后再次参赛
  // ...
];

<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="calculatreFight()">计算赛程</button>

<br><br><br>
<p>请注意：间隔越大，可能导致无足够选手可用，部分场次可能为空。</p>

const data = [
  { 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 calculatreFight() {
  // 获取用户设定的轮休间隔
  const gapNumber = parseInt(document.getElementById("gapNumberInput").value);

  // 存储每场比赛的选手，用于判断后续比赛的疲劳状态
  const tiredFightersList = []; 
  // 存储已编排的原始比赛的索引，避免重复编排
  const compiledIndexes = []; 

  // 使用 map 遍历生成新的赛程数组
  const fights = data.map((element, index) => {    
    // 从 tiredFightersList 中获取最近 gapNumber 场比赛的选手
    // slice(-gapNumber) 获取数组末尾的 gapNumber 个元素
    // reduce 将这些元素（每场比赛的选手数组）扁平化成一个包含所有疲劳选手的数组
    const tiredFighters = tiredFightersList.slice(-gapNumber).reduce((prev, curr) => {
      if (curr) { // 确保 curr 不是 undefined (处理无可用比赛的情况)
        curr.map(fighter => !prev.includes(fighter) ? prev.push(fighter) : null)
      }
      return prev;
    }, []);

    let searchIndex = 0; // 从原始数据开头开始搜索
    // 循环查找符合条件的比赛：
    // 1. 比赛的 fighter1 或 fighter2 不在 tiredFighters 中
    // 2. 该比赛的原始索引尚未被编排 (compiledIndexes)
    while (tiredFighters.includes(data[searchIndex]?.fighter1) ||
           tiredFighters.includes(data[searchIndex]?.fighter2) ||
           compiledIndexes.includes(searchIndex)) {
      searchIndex += 1;
      // 如果搜索到数据末尾，说明没有可用的比赛了
      if (searchIndex >= data.length) break;
    }

    // 记录当前场次（index）的选手，用于后续的疲劳判断
    // 如果 searchIndex 超出范围，data[searchIndex] 为 undefined，此时记录的选手也为 undefined
    tiredFightersList[index] = [data[searchIndex]?.fighter1, data[searchIndex]?.fighter2];
    // 记录当前编排的原始比赛索引
    compiledIndexes.push(searchIndex);

    // 返回新的比赛对象，包含原始数据和新的 fightNumber
    // 如果 data[searchIndex] 为 undefined，则只返回 { fightNumber: index }
    return {
      ...data[searchIndex], // 展开原始比赛数据
      fightNumber: index + 1 // fightNumber 从 1 开始
    };
  });

  console.log(fights);
}

[
  { 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 间隔了 2 场 (2,3) 再次出场
  { id: "6", fighter1: "roger", fighter2: "anna", fightNumber: 5 },
  { id: "4", fighter1: "lee", fighter2: "law", fightNumber: 6 },
  { id: "5", fighter1: "law", fighter2: "paul", fightNumber: 7 }, // paul 间隔了 2 场 (5,6) 再次出场
  { id: "8", fighter1: "roger", fighter2: "anna", fightNumber: 8 },
  { id: "9", fighter1: "lee", fighter2: "jack", fightNumber: 9 }
]