Given a string, find the length of the longest substring without repeating characters.
class Solution {
public:
int lengthOfLongestSubstring(string s) {
map<char,int> record;
int len = 0;
for(int i = 0, j = 0; j < s.length(); j ++)
{
if(record.find(s[j]) != record.end())
{
i = max(i,record[s[j]] + 1);
}
record[s[j]] = j;
len = max(len,j - i + 1);
}
return len;
}
};