感觉挺简单的啊 和 oj答案不一样 哪位帮看看啊
class Solution {
public:
int lengthOfLongestSubstring(string s) {
map mp;
int max_len =0;
int n=s.size();
int j =0;
for(int i=0;i
{
char c = s.at(i);
if( mp.find(c)!=mp.end() ) // found
{
int len = i-j;
if(len>max_len)
{
max_len = len;
}
int jj = mp[c];
for(int k=j;k<=jj;k++) // erase from j to current position
{
mp.erase( s.at(k) );
}
