题目描述
blablabla
样例
blablabla
算法1
时间复杂度
o(n)
参考文献
C++ 代码
class Solution {
public:
int longestSubstringWithoutDuplication(string s) {
vector<int> v(256,-1);
int start = -1;
int res = 0;
for(int i=0;i<s.size();i++)
{
if(v[s[i]]>start)
start = v[s[i]];//change sliding window.
v[s[i]]=i;
res = max(res,i-start);
}
return res;
}
};