leetcode 3 LONGEST SUBSTRING WITHOUT REPEATING CHARACTERS

最新推荐文章于 2025-03-19 11:14:09 发布

原创最新推荐文章于 2025-03-19 11:14:09 发布 · 508 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #c++

leetcode 同时被 2 个专栏收录

120 篇文章

订阅专栏

LeetCode专栏

84 篇文章

订阅专栏

本文介绍了一种寻找字符串中最长无重复字符子串的方法。通过遍历和比对，算法能够有效地找到符合条件的最长子串，并返回其长度。示例代码展示了如何实现这一过程。

Given astring, 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.

public:
    int lengthOfLongestSubstring(string s) {
       string best;
       string temp;

	   size_t found;

       int i=1;
       
       if(s.length()==0) return 0;
	   if(s.length()==1) return 1;

	   best.append(1,s.at(0));
	   temp.append(1,s.at(0));
       
       while(i<s.length())
       {
		   if(temp.find(s.at(i))==string::npos)
		   {
			   temp.append(1,s.at(i));
		   }
		   else
		   {
			   temp.erase(0,(int)temp.find(s.at(i))+1 );//注意需要加1
			   temp.append(1,s.at(i));
		   }
		   if(best.length()<=temp.length())
		   {
			   best.clear();
			   best.resize(temp.length());
			   best.assign(temp);

		   }
		   i++;
       }
	   return best.length();
    }
};