Longest Substring Without Repeating Characters

最新推荐文章于 2024-01-06 13:50:14 发布

icomputational

最新推荐文章于 2024-01-06 13:50:14 发布

阅读量335

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/icomputational/article/details/24199977

版权

leetcode 专栏收录该内容

66 篇文章 0 订阅

订阅专栏

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.

用start,end两个变量来表示当前查看的起始点。首先向后扩展end，直到遇到重复的字符或者字符串结尾，然后更新最大不重复串的长度，接着从start的开始开发一直向后直到和当前end重复的那个index的后一位当作新的start开始下一次循环。这样整个字符串处理过后就得到最长的不重复字串长度了。

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int len = s.length();
        int start = 0, end = 0;
        int ret = 0;
        bool flag[256] = {false};
        while (end < len) {
            while (end < len && flag[s[end]] == 0) {
                flag[s[end]] = true;
                end++;
            }
            ret = max(ret, end - start);
            while (start < end && s[start] != s[end]) {
                flag[s[start]] = false;
                start++;
            }
            
            flag[s[start]] = false;
            start++;
        }
        
        return ret;
    }
};