c++:
class Solution {
public:
int lengthOfLongestSubstring(string s) {
if(s == "") return 0;
int head = 0;
int num = 0, p = 0;
for(int i = 0; i < s.size(); i++){
for(int j = head; j < i; j++){
if(s[i] == s[j]){
head = j + 1;
break;
}
}
p = i - head + 1;
if(num < p)
num = p;
}
return num;
}
};