Leetcode 1704. Determine if String Halves Are Alike

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: trueExplanation: a = "bo" and b = "ok". a has 1 vowel and b has 1 vowel. Therefore, they are alike.

Example 2:

Input: s = "textbook"Output: falseExplanation: 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.

Constraints:

• 2 <= s.length <= 1000

• s.length is even.

• s consists of uppercase and lowercase letters.

主要就是判断字符前半部分跟后半部分包含的元音字母数量是否一样，

1个循环，一个判定即可；

Runtime: 5 ms, faster than 78.43% of Java online submissions for Determine if String Halves Are Alike.

Memory Usage: 42.4 MB, less than 43.27% of Java online submissions for Determine if String Halves Are Alike.