最长子字符串的长度（二）

#include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>
#include <stack>
#include <sstream>
#include <list>
#include <queue>
using namespace std;
class Solution {
public:
	int findTheLongestSubstring(string s) {
		int status = 0, n = s.length();
		int la = -n, le = -n, li = -n;
		int minae = n, minai = n, minei = n, minaei = n;
		//ae最短子串，ai最短子串...

		for (int i = 0; i < n; ++i) {
			if (s[i] == 'a') {
				status ^= 1 << 0;
				minae = min(minae, i - le + 1);
				minai = min(minai, i - li + 1);
				minaei = min(minaei, i - min(le, li) + 1);
				la = i;
			}
			else if (s[i] == 'e') {
				status ^= 1 << 1;
				minei = min(minei, i - li + 1);
				minae = min(minae, i - la + 1);
				minaei = min(minaei, i - min(la, li) + 1);
				le = i;
			}
			else if (s[i] == 'i') {
				status ^= 1 << 2;
				minei = min(minae, i - le + 1);
				minai = min(minai, i - la + 1);
				minaei = min(minaei, i - min(le, la) + 1);
				li = i;
			}
		}
		int cnt = 3;
		for (int i = 0; i < n / 2 && cnt && i< minaei; ++i) {
			if (s[i] == 'a') {
				minae = min(minae, i + n - le + 2);
				minai = min(minai, i - li + 1 + n);
				minaei = min(minaei, i - min(le, li) + 1 + n);
				--cnt;
			}
			else if (s[i] == 'e') {
				minei = min(minei, i - li + 1 + n);
				minae = min(minae, i - la + 1 + n);
				minaei = min(minaei, i - min(la, li) + 1 + n);
				--cnt;
			}
			else if (s[i] == 'i') {
				minei = min(minei, i - le + 1 + n);
				minai = min(minai, i - la + 1 + n);
				minaei = min(minaei, i - min(le, la) + 1 + n);
				--cnt;
			}
		}
		//排除全串基数字符最短子串
		if (status == 0) return n;
		else if ((status & (status - 1)) == 0) return n - 1;
		else if (status == 7) return n - minaei;
		else if (status == 3) return n - minae;
		else if (status == 5) return n - minai;
		return n - minei;
	}
};


int main() {
	Solution s;
	cout << s.findTheLongestSubstring("aiaea");
}