Longest Substring Without Repeating Characters

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

CSLDBLYDX

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

阅读量399

点赞数

CC 4.0 BY-SA版权

分类专栏：区间维护 leetCode

本文链接：https://blog.youkuaiyun.com/CSLDBLYDX/article/details/42037293

leetCode 同时被 2 个专栏收录

39 篇文章

订阅专栏

区间维护

0 篇文章

订阅专栏

本文介绍了一种求解字符串中最长无重复字符子串长度的高效算法实现。通过使用固定大小的数组来记录字符出现次数，算法能够在遍历字符串的同时检查重复字符，并通过滑动窗口的方式动态更新最长子串的长度。

摘要生成于 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:
	const static int MAX = 256 + 10;
	int use[MAX];

	

    int lengthOfLongestSubstring(string s) {
		if(s.size() == 0)return 0;
		for(int i = 0; i < MAX; i++)use[i] = 0;
		int start,end,rtv = 1;

		start = 0;
		end = 1;
		use[s[0]]++;
		for(; end < s.size(); ++end)
		{
			use[s[end]]++;
			if(use[s[end]] > 1)
			{
				while(use[s[end]] > 1)use[s[start++]]--;
			}

			rtv = max(rtv, end - start + 1);
		}
		return rtv;
    }
};