原题链接:Leetcode 1371. 每个元音包含偶数次的最长子字符串
参考题解:Leetcode 1371. 每个元音包含偶数次的最长子字符串
class Solution {
public:
int findTheLongestSubstring(string s) {
vector<int> v(1<<5,INT_MAX);
v[0]=-1;
int state=0,res=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='a') state^=1<<0;
else if(s[i]=='e') state^=1<<1;
else if(s[i]=='i') state^=1<<2;
else if(s[i]=='o') state^=1<<3;
else if(s[i]=='u') state^=1<<4;
if(v[state]==INT_MAX) v[state]=i;
else res=max(res,i-v[state]);
}
return res;
}
};