[프로그래머스][JAVA] 문자열 압축 (문자열)

class Solution {
    public int solution(String s) {
        int answer = s.length();
        
        // s.length()/2까지만 하면 됨
        for(int i=1; i<=s.length()/2; i++){
            String preUnit = "";
            int accumNum = 1;
            int compressedNum = s.length();
            
            for(int j=0; j+i<=s.length(); j+=i){
                // System.out.print(j+" ");
                String currUnit = s.substring(j,j+i);
                if(currUnit.equals(preUnit)){
                    accumNum++;
                    compressedNum-=i;
                }
                else{
                    if(accumNum>1)
                        compressedNum+=(Math.log10(accumNum)+1);
                    accumNum = 1;
                    preUnit = currUnit;
                }
            }
            if(accumNum>1)
                compressedNum+=(Math.log10(accumNum)+1);
            // System.out.println(i+" "+compressedNum);
            answer = Math.min(answer, compressedNum);
        }
        
        
        return answer;
    }
}

import java.util.*;
 
class Solution {
    public int solution(String s) {
        int answer = s.length();
        
        // ex) abc abc (idx1:0 idx2:3 idx3:3 idx4:6)
        
        int startIdx = 0, unit = 1;
        while(unit<=s.length()/2){
            // int[] idx = makeIdxArr(startIdx, unit);
            // for(int i : idx)
            //     System.out.println(i);
            startIdx = 0;            
            int accumNum = 1;
            String preStr = "";
            
            int answerCandi = s.length();
            
            // System.out.println((int)( Math.log10(10)+1 ));
            
            while(true){
                if(startIdx+unit>s.length()){
                    if(accumNum>1)
                        answerCandi+=(int)(Math.log10(accumNum)+1);
                    accumNum = 1;
                    
                    answer = Math.min(answer, answerCandi);
                    break;
                }
            
            
                String currStr = s.substring(startIdx, startIdx+unit);
                
                if(currStr.equals(preStr)){
                    accumNum++;
                    answerCandi -= currStr.length();
                }
                else{
                    /**
                    중복된 문자들 누적된 숫자 처리
                    **/
                    if(accumNum>1)
                        answerCandi+=(int)(Math.log10(accumNum)+1);
                    accumNum = 1;
                    
                  
                }
                preStr = currStr;
                startIdx+=unit;
                // break;
              
            }
            unit++;
        }
        
        
        
        
        
        
        return answer;
    }
    
//     public int[] makeIdxArr(int startIdx, int unit){
//         int[] ret = new int[4];
//         ret[0] = startIdx;
//         ret[1] = startIdx+unit;
//         ret[2] = ret[1];
//         ret[3] = ret[2]+unit;
        
//         return ret;
//     }
}