LetCode 3. 无重复字符的最长子串

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int letter[127];
        int len = s.length();
        int max_len = 1;
        int i = 0;
        int j = 0;
        if (len == 0)
            return 0;
        memset(letter, -1, sizeof(letter));
        for (j = 0; j < len; j++) {
            if (letter[s[j]] >= i) {
                max_len = max(max_len, j - i);
                i = letter[s[j]] + 1;
            }
            letter[s[j]] = j;
        }
        max_len = max(max_len, j - i);
        return max_len;
    }
};