最长非重复字串

最新推荐文章于 2022-02-22 23:21:41 发布

原创最新推荐文章于 2022-02-22 23:21:41 发布 · 558 阅读

0 ·

CC 4.0 BY-SA版权

algorithm 专栏收录该内容

57 篇文章

订阅专栏

本文介绍了一种算法，用于在给定字符串中找到最长的不包含重复字符的子串。通过使用集合来跟踪已访问字符，算法能够高效地解决这一问题。以实例 '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.
 */

#include <iostream>
#include <string>
#include <set>


class Solution
{
public:
	int lengthOfLongestSubstring(std::string s)
	{
		if(s.size()==0)
			return 0;
		std::set<char> state;
		int length=0;
		auto begin=s.begin();
		auto end=s.begin();
		while(end!=s.end())
		{
			while(end!=s.end() && state.find(*end)==state.end())
			{
				state.insert(*end);
				++end;
			}
			if(end-begin>length)
				length=end-begin;
			while(begin<=end && end!=s.end())
			{
				if(*begin==*end)
				{
					++begin;
					++end;
					break;
				}
				else
					state.erase(*begin++);
			}
		}
		return length;
	}
};

int main(int argc,char* argv[])
{
	Solution s;
	std::string str("abcaadfeac");
	std::cout<<s.lengthOfLongestSubstring(str)<<std::endl;
	return 0;
}//程序貌似有误