신규 아이디 추천

문제 링크

programmers.co.kr/learn/courses/30/lessons/72410

코딩테스트 연습 - 신규 아이디 추천

 

문제 풀이 코드

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

using namespace std;

string solution(string new_id) {
    
    //1단계
    for(int i=0; i<new_id.length(); i++){
        if(isupper(new_id[i])){
            new_id[i]=tolower(new_id[i]);
        }
    }
    
    //2단계
    string tmp="";
    for(int i=0; i<new_id.length(); i++){
        if(!isdigit(new_id[i])&&!isalpha(new_id[i])){
            if(new_id[i]=='.'||new_id[i]=='-'||new_id[i]=='_') tmp+=new_id[i];
            else{
                continue;
            }
        }
        else{tmp+=new_id[i];}
    }
    new_id=tmp; tmp="";
    
    //3단계
    int cntp=0;
    for(int i=0; i<new_id.length(); i++){
        if(new_id[i]=='.') {
            cntp++;
            if(cntp>=2){
                continue;
            }
            else{
                tmp+=new_id[i];
            }
        }
        else{
            cntp=0;
            tmp+=new_id[i];
        }        
    }
    new_id=tmp; tmp="";
    
    //4단계
    if(new_id[0]=='.') new_id.erase(0,1);
    if(new_id[new_id.size()-1]=='.') new_id.erase(new_id.size()-1,1); 
    
    //5단계
    if(new_id.size()==0){
        new_id="a";
    }
    
    //6단계
    if(new_id.size()>=16){
        for(int i=0; i<15; i++){
            tmp+=new_id[i];
        }
        new_id=tmp;
    }   
    if(new_id[new_id.size()-1]=='.') new_id.erase(new_id.size()-1,1);
    
    //7단계
    if(new_id.size()<=2){
        char lastc=new_id[new_id.size()-1];
        while(new_id.size()<3){
            new_id+=lastc;
        }
    }
    
    string answer = new_id;
    return answer;
}