Leetcode: Longest Substring Without Repeating Characters

「已注销」

于 2013-09-28 01:43:38 发布

阅读量1.8k

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode 算法与数据结构程序员笔试面试文章标签： Leetcode Longest Substring Wi

本文链接：https://blog.csdn.net/doc_sgl/article/details/12115571

算法与数据结构同时被 3 个专栏收录

223 篇文章

订阅专栏

程序员笔试面试

223 篇文章

订阅专栏

Leetcode

179 篇文章

订阅专栏

本文介绍了一种寻找字符串中最长无重复字符子串长度的算法实现。通过遍历字符串并记录当前不重复子串的长度，更新最长子串长度，最终返回最长无重复子串的长度。

摘要生成于 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.

int lengthOfLongestSubstring(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int longest = 0;
        int slen = s.length();
		if(slen < 0) return 0;
		if(slen == 1) return 1;
		int pre = 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;
    }