[프로그래머스 Lv.2] 2019 카카오 개발자 겨울 인턴십 - 튜플

✨ 문제 ✨

✨ 정답 ✨

function solution(s) {
    var answer = [];
    let copy=s.slice();
    let regExp=/[^0-9|,]/g;
    copy=copy.split('},{').map((el)=> el.replace(regExp,""))
    copy=copy.map((el)=>el.split(',').map((el2)=>+el2))
    copy=copy.sort((a,b)=>a.length-b.length)
    for (let i=0;i<copy.length;i++){
        for (let j=0;j<copy[i].length;j++){
            if (!answer.includes(copy[i][j])){
                answer.push(copy[i][j])
            }
        }
    }
    
console.log(answer)
    return answer;
}


// 시간 초과
function solution(s) {
    var answer = [];
    let copy=s.slice();
    let regExp=/[^0-9|,]/g;
    copy=copy.split('},{').map((el)=> el.replace(regExp,""))
    copy.sort((a,b)=>a.length-b.length)
    let answerMax=new Set(copy)
    answerMax=answerMax.size
    let copyLength=copy.length
    console.log(copy)
    for (let i=0;i<copyLength;i++){
        if (answer.length!==answerMax){
            for (let j=0;j<copy[i].length;j++){
                let splitCopy=copy[i].split(',')
                splitCopy.map((el)=>!answer.includes(el)?answer.push(el):null)
            }                 
        }
    }
    answer=answer.map((el)=>+el)

    return answer;
}

🧵 참고한 정답지 🧵

💡💡 기억해야 할 점 💡💡