Leetcode 3. Longest Substring Without Repeating Characters

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

Example 1:

Input: “abcabcbb”
Output: 3
Explanation: The answer is “abc”, with the length of 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 substring…

寻找字符串中的最长无重复字符子串。
用哈希表来存储每个字符出现的位置。如果未遇到重复的字符，那么向后遍历即可。当遇到重复的字符时，用left指向这个字符上次出现的位置，那么子串的长度就是当前位置i - left。 实际上left和当前的位置i构成了一个滑动窗口，我们只需要去判断重复的两个字符之间的串的长度，并保留最长的字串长度。

    int lengthOfLongestSubstring(string s) {
        int _res = 0;
        int left = -1;
        unordered_map<char,int> mp;
        for(int i = 0;i<s.length();i++)
        {
            if(mp.count(s.at(i))  && mp[s.at(i)] > left)    
            {
                left = mp[s.at(i)];
            }
            mp[s.at(i)] = i;
            _res = max(_res,i-left);
        }
        return _res;
    }