[leetcode]-3. Longest Substring Without Repeating Characters（C语言）

Given a string, find the length of the longest substring without repeating characters.

Example 1:

Input: "abcabcbb"
Output: 3 
Explanation: The answer is "abc", which the length is 3.

Example 2:

Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Example 3:

Input: "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3. 
             Note that the answer must be a substring, "pwke" is a subsequence and not a substri

int lengthOfLongestSubstring(char* s) {
    if(s==NULL)
        return 0;
    int i,j,len=0,a[256]={0};
    int l=0,r=-1;
    int t=strlen(s);
    while(l<t)
    {
        if(r+1<t&&a[s[r+1]]==0)
        {
            r++;
            a[s[r]]++;
        }
        else
        {
            a[s[l]]--;
            l++;
        }
        len=len>(r-l+1)?len:r-l+1;
    }
    return len;
}