leetcode3--Longest Substring Without Repeating Characters

题目：

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.

Subscribe to see which companies asked this question

思路： 大致意思就是找到字符串s中连续的不重复子串， 返回它的长度。 思路就是对每一个字符下标i，记录它前面最长的字符串头下标l[i]， 则对于i+1来说，它前面最长字符串头的下标要么是l[i]， 要么是距离它最近的相同字符的下标+1，所以 l[i+1] = max(l[i], p[s[i+1]] + 1)

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int n = s.length();
        map<char,int> p;
        vector<int> l(n);
        for(int i = 0; i < n; i++)
        {
            if(i == 0)
                l[i] = 0;
            else
            {
                if(p.find(s[i]) != p.end())
                {
                    l[i] = max(l[i-1], p[s[i]] + 1);
                }
                else
                {
                    l[i] = l[i-1];
                }
            }
        
            p[s[i]] = i;
        }
        
        int sum = 0;
        for(int i = 0; i < n; i++)
        {
            sum = max(sum, i - l[i] + 1);
        }
        
        return sum;
    }
};