解法1
class Solution {
public:
int lengthOfLongestSubstring(string s)
{
unordered_map<int, int> m;
int max = 0;
for(int i = 0; i < s.size(); ++i)
{
int sum = 0;
for(int j = i; j < s.size(); ++j)
{
if(m.find(s[j]) != m.end())
{
m.clear();
break;
}
m[s[j]] = 1;
++sum;
if(sum > max)
max = sum;
}
}
return max;
}
};