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.

思路上是，从左到右开始扫描，如果遇到重复的，则从上个重复的idex+1出开始扫描。字符有256个，可以使用数组来保存开始的位置。

int longestSubstring(string s)
{
    vector<int> dict(256, -1);
    int start=-1,maxlen=0;
    for(int i=0;i<s.size();i++)
    {
        if(dict[s[i]]>start)//如果当前字符在start后面出现过，即重复出现了
            start=dict[s[i]];//那么把start调整为这个字符上次出现的位置
        dict[s[i]]=i;
        maxlen=max(maxlen,i-start);
    }
    return maxlen;
}

---

参考：
[1]https://discuss.leetcode.com/topic/24739/c-code-in-9-lines