LeetCode3

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

int lengthOfLongestSubstring(char* s) {
    int map[256]={0};
    int left=0;
    int L=0;
    int i=1;
    while(s[i-1] != '\0'){
        if(map[s[i-1]] == 0 || map[s[i-1]] < left){    
            L=L>(i-left)?L:(i-left);
        }else{
            left=map[s[i-1]];
        }
        map[s[i-1]]=i;
        i++;
    }
    return L;
}