[알고리즘문제풀기] 옹알이 (1)

문제

내가 작성한 정답

class Solution {
    public int solution(String[] babbling) {
        int answer = 0;
        String[] st = { "aya", "ye", "woo", "ma"};
        for(String s:babbling){
            for(String ss: st){
                s = s.replaceFirst(ss," ");
            }
            if(s.trim().isEmpty()) answer++;
        }
        return answer;
    }
}

다른 사람들의 정답

class Solution {
    public int solution(String[] babbling) {
        int answer = 0;
        for(int i=0; i<babbling.length; i++){
            if(babbling[i].matches("^(aya(?!aya)|ye(?!ye)|woo(?!woo)|ma(?!ma))+$")){
                answer++;
            }
        }
        return answer;
    }
    
    
    class Solution {
    public int solution(String[] babbling) {
        int answer = 0;

        for(int i =0; i < babbling.length; i++) {
            babbling[i] = babbling[i].replace("aya", "1");
            babbling[i] = babbling[i].replace("woo", "1");
            babbling[i] = babbling[i].replace("ye", "1");
            babbling[i] = babbling[i].replace("ma", "1");
            babbling[i] = babbling[i].replace("1", "");
            if(babbling[i].isEmpty()) {
                answer = answer + 1;
            }
        }

        return answer;
    }
}
}