Algorithm

Array_Press.js

function solution(s){
    var answer = 0;
    var cnt = 0, check1 = "", check2 = "";
    var length = [];
    for(var i = 1; i < s.length; i++){
        var strCh = "";
        for(var j = 0; j < s.length;){
            check1 = s.substr(j,i);
            check2 = s.substr(j + i, i);
            
            if(check1 == check2){
                cnt++;
            }
            else{
                if(cnt >= 1){
                    strCh += (cnt+1) + check1;
                    cnt = 0;
                }
                else{
                    strCh += check1;
                    cnt = 0;
                }
            }
            j = j + i; 
        }
        length.push(strCh.length);
    }
    answer = length[0];
    for(var k = 0; k < length.length; k++){
        if(answer > length[k]){
            answer = length[k];
        }
    }
    return answer;
}