1704. Determine if String Halves Are Alike(String, Counting)

YAMAMAMO·2022년 12월 1일
0

LeetCode

목록 보기
88/100

문제

You are given a string s of even length. Split this string into two halves of equal lengths, and let a be the first half and b be the second half.
Two strings are alike if they have the same number of vowels ('a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'). Notice that s contains uppercase and lowercase letters.
Return true if a and b are alike. Otherwise, return false.

Example 1:

Input: s = "book"
Output: true
Explanation: a = "bo" and b = "ok". a has 1 vowel and b has 1 vowel. Therefore, they are alike.

Example 2:

Input: s = "textbook"
Output: false
Explanation: a = "text" and b = "book". a has 1 vowel whereas b has 2. Therefore, they are not alike.
Notice that the vowel o is counted twice.

풀이

class Solution {
    public boolean halvesAreAlike(String s) {
        char[] c = s.toLowerCase().toCharArray();
        int j = c.length-1;
        int count = 0;
        for(int i = 0; i <= c.length/2-1; i++, j--){
            if(checkVowels(c[i])) count++;
            if(checkVowels(c[j])) count--;         
        }
        return count==0 ? true : false;
    }

    public boolean checkVowels(char c){
        if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u') return true;
        
        return false;
    }
}
profile
안드로이드 개발자

0개의 댓글