class Solution {
public:
int lengthOfLongestSubstring(string s) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int n=s.size();
if(n<=1) return n;
map<char,int> numMap;
map<char,int>::iterator it;
int begin=-1,result=0;
for(int i=0;i<n;i++)
{
it=numMap.find(s[i]);
if(it!=numMap.end())
begin=max(begin,numMap[s[i]]);
result=max(result,i-begin);
numMap[s[i]]=i;
}
return result;
}
};
leetcode-3:Longest Substring Without Repeating Characters
最新推荐文章于 2021-12-03 15:58:56 发布