[프로그래머스 Lv.2] 2020 KAKAO BLIND RECRUITMENT - 문자열 압축

✨ 문제 ✨

✨ 정답 ✨

function solution(s) {
    var answer = s.length;
    // 최대값이...절반이겠지....?
    for (let i=1;i<=Math.floor(s.length/2);i++){
        let sentence="";
        let index=0;
        while(index<s.length){
            let count=1;
            while(s.slice(index, index+i)===s.slice(index+i, index+i+i)){
                count+=1;
                index+=i;
            }
            if (count>1){
                sentence+=count;
            }
            let str=s.slice(index, index+i);
            sentence=sentence+str;
            index+=i;
        }
        answer=Math.min(answer, sentence.length);
    }
    return answer;
}

🧵 참고한 정답지 🧵

https://velog.io/@dev-redo/%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4-%EB%AC%B8%EC%9E%90%EC%97%B4-%EC%95%95%EC%B6%95-js

💡💡 기억해야 할 점 💡💡