Given a string, find the length of the longest substring without repeating characters.
Examples:
Given "abcabcbb"
, the answer is "abc"
, which the length is 3.
Given "bbbbb"
, the answer is "b"
, with the length of 1.
Given "pwwkew"
, the answer is "wke"
, with the length of 3. Note that the answer must be a substring, "pwke"
is a subsequence and not a substring.
class Solution {
public:
int lengthOfLongestSubstring(string s) {
int res=0,start=-1; // start 表示每次最不开始重复的位置 abcbad
vector<int> ivec(256,-1);
if(s.size()==0){
return 0;
}
for(int i=0;i!=s.size();++i){
if(ivec[s[i]]>start){
start=ivec[s[i]]; // ivec when ocurr repeart start=上一个重复的位置
}
ivec[s[i]]=i;
res=max(res,i-start);
}
return res;
}
};