[프로그래머스 Lv.2] 2018 KAKAO BLIND RECRUITMENT - [3차] 파일명 정렬

✨ 문제 ✨

✨ 정답 ✨

function solution(files) {
    let cutArray=Array.from({length:files.length}, ()=>new Array(3).fill(0))
    for (let i=0;i<files.length;i++){
        let cutCopy=files[i].split('')
        let head=[];
        let number=[];
        let tail=[];
        let indexIs=0;
        for (let j=0;j<cutCopy.length;j++){
            if (isNaN(cutCopy[j])||cutCopy[j]===' '){
                head.push(cutCopy[j])
            }   else{
                indexIs=j;
                break;
            }
        }
        for (let k=indexIs;k<cutCopy.length;k++){
            if (number.length<5&&!isNaN(cutCopy[k])){
                number.push(cutCopy[k])
                if (k===cutCopy.length-1){
                    indexIs=k+1;
                }
            }else{
                indexIs=k;
                break;
            }
        }
        tail=cutCopy.slice(indexIs,);
        cutArray[i]=[head.join(''), number.join(''), tail.join('')]     
    }
    cutArray=cutArray.sort((a,b)=>{
             if (b[0].toUpperCase() > a[0].toUpperCase()){
                return -1;   
             }
            else if (a[0].toUpperCase() > b[0].toUpperCase()){
                return 1;  
            }
        if(+b[1]>+a[1]){
            return -1;
        }
        else if (+a[1]>+b[1]){
            return 1;
        }else{
            return 0;
        }
    })    
    cutArray=cutArray.map((el)=>el.join(''))
    return cutArray;
}

🧵 참고한 정답지 🧵

💡💡 기억해야 할 점 💡💡