题目链接:https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/
#include <iostream>
#include<set>
#include<cstring>
int vis[1000];
using namespace std;
class Solution {
public:
int lengthOfLongestSubstring(string s) {
int Len=s.length();
int ans=0,k=0;
memset(vis,0,sizeof(vis));
for(int i=0;i<Len;i++){
vis[s[i]+48]=1;
k=1;
for(int j=i+1;j<Len;j++){
if(vis[s[j]+48]==0){
k++;
vis[s[j]+48]=1;
}
else break;
}
memset(vis,0,sizeof(vis));
//cout<<k<<endl;
ans=max(ans,k);
}
return ans;
}
};
/* main()
{
string s;
cin>>s;
Solution a;
int ans=a.lengthOfLongestSubstring(s);
cout<<ans;
return 0;
}*/