[LeetCode]Longest Substring Without Repeating Characters

最新推荐文章于 2025-05-18 01:04:12 发布

Jet_yingjia

最新推荐文章于 2025-05-18 01:04:12 发布

阅读量626

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/Jet_yingjia/article/details/25504711

LeetCode 专栏收录该内容

33 篇文章

订阅专栏

本文介绍了一种寻找字符串中最长无重复字符子串的方法。通过遍历字符串并记录每个字符最后一次出现的位置来实现，避免了重复字符，最终找出最长的无重复字符子串。

摘要生成于 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) {
        int slen = s.length();  
        if(slen <= 0) 
	    {
		    return 0;   
	    }  
	    if(slen == 1)
	    {
		    return 1;
	    }
        //前一个字母对应的字串的长度（往前算：如bccbbc对应pre：121212）
        int pre = 1;
        int longest = 1;
        for(int i = 1; i < slen; ++i)  
        {  
            char tmp = s[i];  
            int j = i-1;  
            int count = 1;  
            while((j>=0) && (tmp != s[j]))  
            {
                j--;
                count++;
            }  
            if(count >= pre+1)
                count = pre+1;  
            if(count > longest) 
                longest = count;  
            pre = count;  
        }  
        return longest;  
    }
};