- C++
class Solution {
public:
int lengthOfLongestSubstring(string s) {
int num = s.length();
int result = 0;
int begin = 0;
for (int end = 0; end < num; end++) {
for (int index = begin; index < end; index++) {
if (s[end] == s[index]) {
begin = index + 1;
break;
}
}
if (result < end - begin + 1) {
result = end - begin + 1;
}
}
return result;
}
};