알고리즘 풀이/프로그래머스
[프로그래머스][JAVA] 옹알이 (String)
배게
2022. 10. 31. 02:26
728x90
Line:13
babCurr중 speakList들의 element를 replace할 때
babCurr = babCurr.replace(speak,"");
공백으로 치환했더니 테스트케이스 wyeoo에서 실패함
wyeoo -> w[ye]oo -> woo -> [woo] -> (공백)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
class Solution {
private String[] banList = {"ayaaya", "yeye", "woowoo", "mama"};
private String[] speakList = {"aya", "ye", "woo", "ma"};
public int solution(String[] babbling) {
int answer = 0;
for(String bab : babbling){
String babCurr = bab;
for(String ban : banList){
babCurr = babCurr.replace(ban, "b"); // ban
}
for(String speak : speakList){
babCurr = babCurr.replace(speak,"p"); //pass
}
babCurr = babCurr.replace("p","");
answer = (babCurr.length()==0)?answer+1:answer;
}
return answer;
}
}
|
cs |