LEETCODE3. Longest Substring Without Repeating Character

LEETCODE3. Longest Substring Without Repeating Characters

l为选择的字符串开头, r为选择的字符串的结尾
r一直右移, 直到与str[r]==str[k] (l<=k< r), 记录该候选字符长度r-l,并与maxlen作比较
l变为k+1, r一直右移…直到=length-1

    int lengthOfLongestSubstring(string s) {        int l=0;        int r=0;        int maxlen = 0;        int len = 0;        bool dict[256]= {false};        while (r < s.length())        {            if (dict[s[r]] == true)            {                len = r-l;                maxlen = max(maxlen, len);                while (s[l] != s[r])                {                    dict[s[l]] = false;                    l++;                }                l++;            }            dict[s[r]] = true;            r++;        }        int length = s.length()-l;        maxlen = max(maxlen, length);          return maxlen;    }

maxlen = max(maxlen, length);若写为maxlen max(maxlen, s.length()-l)出错