Longest Substring Without Repeating Characters

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

Examples:

Given “abcabcbb”, the answer is “abc”, which the length is 3.

Given “bbbbb”, the answer is “b”, with the length of 1.

Given “pwwkew”, the answer is “wke”, with the length of 3. Note that the answer must be a substring, “pwke” is a subsequence and not a substring.

int lengthOfLongestSubstring(char* s) {    int i = 0,j = 0;    int len = strlen(s);    int max = 0, cur_len= 0;    bool exist[256] = {false};    while(j<len)     {        if(!exist[s[j]])        {            exist[s[j]]=true;            j++;        }        else        {            while(s[i] != s[j]) //寻找新的起点，重新扫描            {                exist[s[i]] = false;                i++;            }            i++;            j++;        }        cur_len = j - i;        max = max > cur_len ? max : cur_len;    }    return max;}