暴力解:
class Solution {
public:
bool checkdifferent(string string){
const char *c = string.c_str();
//cout<<string<<endl;
int len = string.length();
for(int i = 0;i<len;i++)
for(int j = i+1;j<len;j++){
if(c[i] == c[j]){
return false;
}
}
return true;
}
int lengthOfLongestSubstring(string s) {
int cycle = 0;
int i,j;
string str;
int len = s.length();
for( i = 0;i<len;i++){
for( j = 0;j<=len-i;j++){
str = s.substr(i,j) ;
if(checkdifferent(str)){
cycle = str.length()>cycle? str.length(): cycle;
}else
break;
}
}
return cycle;
}
};