leetcode5.2

3、寻找最长的无重复字符串max

class Solution
{
public: 
	int lengthOfLongestSubstring(string s)
   {
	unordered_set<char>set;
	int len = s.size();
	int i = 0, j = 0;
	int res = 0;
	while(j<len)
	{   if (set.find(s[j]) == set.end())
		{
		set.insert(s[j]);
		j++;
		}
	    else
	    {
		res = (res > (j-i) ? res : (j-i));
		set.erase(s[i]);
		i++;
	    }
	}
	return (res>set.size()?res:set.size());
    }
};

leetcode5.2

原文：https://www.cnblogs.com/wfplingyun/p/12819622.html