LeetCode 1704. 判断字符串的两半是否相似

思路：暴力

代码：

class Solution {
public:
    int check(string s) {
        string t = "aeiouAEIOU";
        int res = 0;
        for (auto x: t) {
            for (auto y: s) 
                if (x == y) res ++;
        }
        return res;
    }
    bool halvesAreAlike(string s) {
        string s1 = s.substr(0, s.size() / 2), s2 = s.substr(s.size() / 2);
        return check(s1) == check(s2);
    }
};
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16