-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathDay 40.2.txt
55 lines (39 loc) · 1.42 KB
/
Day 40.2.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
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: 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.
Example 3:
Input: s = "MerryChristmas"
Output: false
Example 4:
Input: s = "AbCdEfGh"
Output: true
Constraints:
2 <= s.length <= 1000
s.length is even.
s consists of uppercase and lowercase letters.
class Solution {
public boolean halvesAreAlike(String s) {
s=s.toLowerCase();
int i,c=0,k=0;
for(i=0;i<s.length()/2;i++)
{
char l=s.charAt(i);
if(l=='a'||l=='e'||l=='i'||l=='o'||l=='u')
c++;
l=s.charAt(i+s.length()/2);
if(l=='a'||l=='e'||l=='i'||l=='o'||l=='u')
k++;
}
return c==k ? true : false;
}
}