2 - Longest Substring Without Repeating Characters

superrobin

于 2013-09-11 11:27:43 发布

阅读量471

点赞数

CC 4.0 BY-SA版权

分类专栏： C++ LeetCode Interview Questions

本文链接：https://blog.youkuaiyun.com/superrobin/article/details/11367563

C++ 同时被 2 个专栏收录

45 篇文章

订阅专栏

LeetCode Interview Questions

45 篇文章

订阅专栏

本文介绍了一种算法，用于在给定字符串中找到最长的无重复字符子串。通过使用滑动窗口技巧和哈希表，实现了一个高效的解决方案。实例包括分析字符串 'abcabcbb' 和 'bbbbb' 的最长无重复子串。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<int>fre(255,0);
        int curLen = 0;
        int maxLen = 0;
        int length = s.length();
        int start = 0;
        for(int i = 0; i< length; i++)
        {
            char ch = s.at(i);
            if(fre[ch] == 0)
            {
                fre[ch] ++;
                curLen = i - start + 1;
                if(curLen > maxLen)
                    maxLen = curLen;
            }
            else
            {
                if(curLen>maxLen)
                    maxLen = curLen;
                char temp = s.at(start);
                while(start < i && temp != ch)
                {
                    fre[ temp ] = 0;
                    start++;
                    temp = s.at(start);
                }
                start++;
            }
        }
        return maxLen;
    }
};