class Solution {
public int lengthOfLongestSubstring(String s) {
int length = s.length();
if (length == 0) {
return 0;
}
int num = 1;
int max = 1;
for (int i = 1; i < length; i++) {
int index = s.indexOf(s.charAt(i), i - num);
if (i<=index) {
num = num + 1;
} else {
num = i - index;
}
max = Math.max(max, num);
}
return max;
}
}