Problem: 1704. 判断字符串的两半是否相似统计判断是否相等Codeclass Solution { public: bool halvesAreAlike(string s) { int n s.size(); int n2 n / 2, c0 0, c1 0; for(int i 0; i n2; i) { if(s[i]a || s[i]e || s[i]i || s[i]o||s[i]u || s[i] A || s[i]E || s[i]I || s[i]O || s[i]U) { c0; } } for(int i n2; i n; i) { if(s[i]a || s[i]e || s[i]i || s[i]o||s[i]u || s[i] A || s[i]E || s[i]I || s[i]O || s[i]U) { c1; } } return c0c1; } };
Problem: 1704. 判断字符串的两半是否相似统计判断是否相等Codeclass Solution { public: bool halvesAreAlike(string s) { int n s.size(); int n2 n / 2, c0 0, c1 0; for(int i 0; i n2; i) { if(s[i]a || s[i]e || s[i]i || s[i]o||s[i]u || s[i] A || s[i]E || s[i]I || s[i]O || s[i]U) { c0; } } for(int i n2; i n; i) { if(s[i]a || s[i]e || s[i]i || s[i]o||s[i]u || s[i] A || s[i]E || s[i]I || s[i]O || s[i]U) { c1; } } return c0c1; } };
