日常

leetcode第三题
class Solution {
public:
int lengthOfLongestSubstring(string s) {
int i=0,j=1;
int length=1;
int max=1;
while (s.length()==0)
return 0;
unordered_map<char,int> bank;
while(i!=s.length()-1)
{ bank.insert({s[i],i});
while(bank.find(s[j])==bank.end())
{ bank.insert({s[j],j});
length++;
j++;
}
if(length>max)
max=length;
while(bank.find(s[j])!=bank.end())
{
bank.erase(i);
i++;
length–;
}
}
return max;
}
};
执行出错