力扣第3题 无重复字符的最长子串

class Solution {
    public:
    int lengthOfLongestSubstring(string s) {
        int len = s.size();
        map<char, int> myMap;
        map<char, int>::iterator itor;
        int start = 0;
        int maxNum = 0;
        for (int i = 0; i < len; i++)
        {
            itor = myMap.find(s[i]);
            if (itor != myMap.end())
            {
                start = max(itor->second, start);
            }
            myMap[s[i]] = i + 1;
            maxNum = max(maxNum, i - start + 1);
        }
        return maxNum;
    }
};

力扣第3题 无重复字符的最长子串

原文：https://www.cnblogs.com/woodjay/p/12375369.html