https://leetcodechina.com/problems/longest-substring-without-repeating-characters/description/
有点dp的意思
dp[i]:末尾为i位置的不含有重复字符的 最长子串 的长度
dp[i]=max(vis[s[i]]+1,i+1-dp[i-1])~~~i
t代表i-1时不含有重复字符的 最长子串的最左位置
class Solution {
public:
int lengthOfLongestSubstring(string s) {
int vis[130], ans = 0, t = 0;
memset(vis, -1, sizeof(vis));
for (int i = 0; i < s.size(); ++i)
t = max(vis[s[i]]+1, t), ans = max(ans, i - t + 1), vis[s[i]] = i;
return ans;
}
};