class Solution {
public:
int lengthOfLongestSubstring(string s) {
int flag=0;
int count=0;
int l=0;
int result=1;
int differ=0;
if(s=="") return 0;
for(int i=0;i<s.size();i++){
for(int j=i-count;j<i;j++){
if(s[j]==s[i]){
flag=1;
differ=i-j-1;
break;
}
}
if(flag==0){
count++;
if((i==s.size()-1)&&result<count){
result=count;
}
}
else{
if(result<count) result=count;
l=count;
count=1+differ;
flag=0;
}
}
return result;
}
};