Lv.2 피로도

🤖문제

👍🏻 2022년 2월 7일

<script>
  const permutation = (arr, n) => {
      let result = [];
      if (n === 1) return arr.map((v) => [v]);
      arr.forEach((v, idx, arr) => {
        const fix = v;
        const rest = arr.filter((_, index) => index !== idx);
        const permuationArr = permutation(rest, n - 1);
        const combineFix = permuationArr.map((v) => [fix, ...v]);
        result.push(...combineFix);
      });
      return result;
    }

  function solution(k, dungeons) {
      var answer = 0;
      let per = permutation(dungeons, dungeons.length);
      per.forEach(row => {
          let currK = k;
          let cnt = 0;
          row.forEach(v => {
              if (currK >= v[0]) {
                  currK -= v[1];
                  cnt++;
              }
          })
          answer = Math.max(answer, cnt);
      })
      return answer;
  }
</script>