无重复最长子串的长度

#include<bits/stdc++.h>

using namespace std;


int main(void)
{
	string s;
	cin >> s;
	vector<int> vi(256, -1);
	int maxx = 0, start = -1;
	for (int i = 0; i < s.size(); i++)
	{
		if (vi[s[i]] > start)start = vi[s[i]];
		vi[s[i]] = i;
		maxx = max(maxx, i - start);
	}
	cout << maxx;
}
发布了181 篇原创文章 · 获赞 13 · 访问量 1万+

猜你喜欢

转载自blog.csdn.net/qq_43461641/article/details/105280008