[프로그래머스 Lv.2] 2021 KAKAO BLIND RECRUITMENT - 메뉴 리뉴얼

✨ 문제 ✨

✨ 정답 ✨

const getCombinations = function (arr, selectNumber) {
  const results = [];
  if (selectNumber === 1) return arr.map((value) => [value]);
  arr.forEach((fixed, index, origin) => {
    const rest = origin.slice(index + 1); 
    const combinations = getCombinations(rest, selectNumber - 1); 
    const attached = combinations.map((combination) => [fixed, ...combination]); 
    results.push(...attached);
  });
  return results;
};

function solution(orders, course) {
    var answer = [];
    for (let i=0;i<course.length;i++){
        let possibleArray=[];
        for (let j=0;j<orders.length;j++){
            // 가능한 조합 다 찾기
            let permutateArray=orders[j].split('').sort();
            possibleArray.push(...getCombinations(permutateArray, course[i] ))
        }
        possibleArray=possibleArray.map((el)=>el.join(''))
        let possibleCounted=[];
        let possibleArraySet=[...new Set(possibleArray)]
        let max=0;
        if (possibleArraySet.length>1){
        for (let i=0;i<possibleArraySet.length;i++){
            let keyIs=possibleArraySet[i]
            let count = possibleArray.reduce((cnt, element) => cnt + (keyIs === element), 0);
            count>max?max=count:max=max;
            possibleCounted.push([keyIs, count])
        }
        if (max>1){
            possibleCounted.map((el)=>el[1]===max?answer.push(el[0]):0)
            }
        }
    }
    return answer.sort();
}

🧵 참고한 정답지 🧵

💡💡 기억해야 할 점 💡💡

어어.. 이게 왜 시간초과가 나지 않는 걸까.. 어어...
순열 조합 찾는 코드 익혀둬야겠다.

🚒🚒🚒 조합 코드 🚒🚒🚒

const getCombinations = function (arr, selectNumber) {
  const results = [];
  if (selectNumber === 1) return arr.map((value) => [value]);
  arr.forEach((fixed, index, origin) => {
    const rest = origin.slice(index + 1); 
    const combinations = getCombinations(rest, selectNumber - 1); 
    const attached = combinations.map((combination) => [fixed, ...combination]); 
    results.push(...attached);
  });
  return results;
};