문자열 p와 y의 개수(문제11)

class Solution {
    boolean solution(String s) {
        s = s.toLowerCase();
        
        int ps = s.length() - s.replace("p","").length();
        int ys = s.length() - s.replace("y","").length();
        
        return ps == ys;
    }
}

class Solution {
    boolean solution(String s) {
        int ps=0;
        int ys=0;
        
        for(char c : s.toCharArray()){
            switch(c){
                    case 'p','P' -> ps++;
                    case 'y','Y' -> ys++;
            }
        }
        
        return ps == ys;
    }
}