Longest Substring Without Repeating Characters

3. Longest Substring Without Repeating Characters

Medium

7654450Add to ListShare

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.

参考https://www.cnblogs.com/grandyang/p/4480780.html

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        unordered_map<char, int> map;
        int maxcnt=0;
        int left=-1;
        for(int i=0; i<s.length(); i++) {
            if(map[s[i]] && map[s[i]]>left) {
                left = map[s[i]];
            }
            map[s[i]] = i;
            maxcnt = max(maxcnt, i-left)
        }
        return maxcnt;
    }
};




class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        vector<int> m(128, -1);
        int res = 0, left = -1;
        for (int i = 0; i < s.size(); ++i) {
            left = max(left, m[s[i]]);
            m[s[i]] = i;
            res = max(res, i - left);
        }
        return res;
    }
};