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

문제

 

분석

압축한다.. 딱히 분석할게 없었다.

 

구현

#include <string>
#include <vector>
#include <iostream>

using namespace std;

int solution(string s){

    int answer = 0;
    int findCount = 0;
    int index = 0;
    int minCount = 987654321;
    string findString="";
    string compressString = "";

    for(int i =1; i <= s.size(); i++)
    {
        findCount = i;
        findString = s.substr(0,findCount);
        int matchCount = 0;
        for(int j = 0; j< s.size(); j+=findCount){
            string tmpString = s.substr(j,findCount);
            if( findString ==  tmpString ){
                matchCount++;
            } else {
                if( matchCount>1){
                    compressString += to_string(matchCount)+findString;
                } else {
                    compressString += findString;
                }
                findString = tmpString;
                j-=findCount;
                matchCount = 0;
            }
        }

        if( matchCount>1){
            compressString += to_string(matchCount)+findString;
        } else{
            compressString+=findString;
        }
        
        if( compressString.size() < minCount ){
            minCount = compressString.size();
        }
        compressString="";
    }
    answer = minCount;
    return answer;
}

 

 

 

 

 

문제링크: https://programmers.co.kr/learn/courses/30/lessons/60057

코딩테스트 연습 - 문자열 압축