Portfolio


function solution(cards) {
  var swap = new Set([]);

  function findMinIdx(arr, idx) {
    var want = Math.min(...arr);

    const count = arr.filter((a) => a === want).length;
    if (count > 1) {
      swap.add(idx);
      return -1;
    }

    return arr.indexOf(want);
  }
  const mins = cards.map((card) => Math.min(...card));
  const minIdxs = cards.map((card, idx) => findMinIdx(card, idx));


  for (let i = 0; i < cards.length; i++) {
    if (swap.has(i)) {
      continue;
    }
    swap.add(i);

    for (let j = 0; j < cards.length; j++) {
      if (
        i !== j &&
        !swap.has(j) &&
        minIdxs[i] !== minIdxs[j] &&
        cards[i][minIdxs[i]] !== cards[i][minIdxs[j]] - 1 &&
        cards[j][minIdxs[j]] !== cards[j][minIdxs[i]] - 1
      ) {
        mins[i] += 1;
        mins[j] += 1;
        swap.add(j);
        break;
      }
    }
  }
  const answer = mins.reduce((acc, cur) => acc + cur);

  return answer;
}

카드교환

1️⃣ 문제

2️⃣ 문제 해결 전략

3️⃣ 코드 및 설명

4️⃣ 시간복잡도