leetcode 练习题 -- 3. Longest Substring Without Repeating Characters

TOBEALISTENER

于 2018-01-14 12:16:15 发布

阅读量137

点赞数

CC 4.0 BY-SA版权

分类专栏：算法竞赛文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/TOBEALISTENNER/article/details/79055826

算法竞赛专栏收录该内容

148 篇文章

订阅专栏

本文介绍了一种求解字符串中最长无重复字符子串长度的方法。通过使用C++编程语言实现，具体算法思路为：利用滑动窗口配合哈希集合进行遍历，实时更新最长子串的长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

Given a string, find the length of the longest substring without repeating characters.

Examples:

Given "abcabcbb", the answer is "abc", which the length is 3.

Given "bbbbb", the answer is "b", with the length of 1.

Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be asubstring, "pwke" is asubsequence and not a substring.

Code:

class Solution {
public:
	int lengthOfLongestSubstring(string s) {
		set<char> m;
		int max = 0, k;
		for (int i = 0; i < s.length(); i++)
		{
			k = 0;
			for (int j = i; j < s.length(); j++)
			{
				m.insert(s[j]);
				if (m.size() == k)
					break;
				k = m.size();
			}
			m.clear();
			if (k>max)
				max = k;
		}
		return max;
	}
};