该博客介绍了如何使用滑动窗口算法在O(n)的时间复杂度内解决找到字符串中最长无重复字符子串的问题。通过设置两个指针i和j来维护窗口的左右边界，当窗口内的字符不包含s[j+1]时，右边界右移，否则左边界右移。使用HashSet存储不重复字符以确保高效查找。
问题描述：
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 asubsequence and not a substring
我想的是用两层for来遍历，求出每一个位置上的
最低0.47元/天 解锁文章
扫一扫
1176
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
