반응형
문제: https://programmers.co.kr/learn/courses/30/lessons/72410
출처: https://www.youtube.com/watch?v=QgiUy-N_j3s&list=PL6YHvWRMtz7DhuPHdUZ0WLB5fNO729mbm
public class Main {
public static void main(String[] args) {
solution("문자열");
}
static boolean Static isValid(char c){
if(Character.isLetterOrDigit(c)) return true;
if(c == '-'|| c =='_'|| c=='.') return true;
return false;
}
public static String solution(String new_id){
StringBuilder answer = new StringBuilder();
boolean lastDot = false;
for(char ch : new_id.toCharArray()){
if(isValid(ch) == false) continue;
if(ch == '.'){
if(answer.length() == 0 || lastDot) continue;
lastDot = true;
}else{
lastDot = false;
}
ch = Character.toLowerCase(ch);
answer.append(ch);
}
if(answer.length() >=16){
answer.setLength(15);
}
if(answer.length() == 0){
answer.append('a');
}
if(answer.charAt(answer.length()-1) == '.')
answer.deleteCharAt(answer.length() - 1);
if(answer.length() <= 2){
char ch = answer.charAt(answer.length() - 1);
while(answer.length() < 3){
answer.append(ch);
}
}
return answer.toString();
}
}
반응형
'Algorithm' 카테고리의 다른 글
백트래킹DFS_백준 N과M(4) (0) | 2021.11.09 |
---|---|
백트래킹DFS_백준 N과M(1) (0) | 2021.11.09 |
완전탐색_2019 삼성 낚시왕 (0) | 2021.11.08 |
BruteForce_백준 1051 숫자 정사각형 (0) | 2021.11.07 |
DP_N*N 이동경로 최대값을 구하라(음수존재) (0) | 2021.11.07 |