# LeetCode Longest Substring Without Repeating Characters 最长不重复子串查找

Algorithm算法 同时被 2 个专栏收录
568 篇文章 0 订阅
194 篇文章 213 订阅

Longest Substring Without Repeating Characters

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.

1 利用maxlength变量记录当前已经查找到的最长不重复子串

2 巧妙的移动两个下标，如下图示：

class Solution {
public:
int lengthOfLongestSubstring(string s) {
int n = s.length();
int i = 0;
int j = 0;
bool found[26] = {false};
int maxLength = 0;
for (; i < n; i++)
{
if (!found[s[i] - 'a'])
{
found[s[i] - 'a'] = true;
}
else
{
maxLength = max(maxLength, i-j);
//注意：这里是关键，i是等到第二次s[i]==s[j]的时候才往前进的，而且是始终指向前一次重复出现字母的后一个字母。
while (s[i] != s[j])
{
found[s[j] - 'a'] = false;
j++;
}
j++;
}
}
maxLength = max(maxLength, n-j);
return maxLength;
}
};

• 1
点赞
• 0
评论
• 0
收藏
• 打赏
• 扫一扫，分享海报

10-15 1万+
03-27 1518

07-30 2万+
01-05 88
09-05 741
03-03 644
04-19 176
02-04 87
09-04 6757
05-11 3872
11-10 2722
08-18 1577

¥2 ¥4 ¥6 ¥10 ¥20

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。