【leetcode】3.Longest Substring Without Repeating Characters（c语言）

最新推荐文章于 2024-01-06 13:50:14 发布

原创最新推荐文章于 2024-01-06 13:50:14 发布 · 422 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

257 篇文章

订阅专栏

本文详细解析了寻找字符串中最长无重复字符子串的算法实现，通过具体示例展示了如何使用窗口滑动方法来高效解决问题。文章包含了完整的代码示例及运行结果，适合对字符串操作和算法优化感兴趣的读者。

Description：

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

Example1:

Input: “abcabcbb”
Output: 3
Explanation: The answer is “abc”, with the length of 3.

Example2:

Input: “bbbbb”
Output: 1
Explanation: The answer is “b”, with the length of 1.

Example3:

Input: “pwwkew”
Output: 3
Explanation: The answer is “wke”, with the length of 3.
Note that the answer must be a substring, “pwke” is a subsequence and not a substring.

[ 题目链接 ]

注意点：
1.空字符串
2.窗口滑动方法

int lengthOfLongestSubstring(char* s) {
	if (s == "")	return 0;   //?????

	int max = 0,i=0,j=0,k,flag=0,max_tmp=0;

	while (s[j] != '\0')
	{	
		for (k = j-1; k >= i; k--)
		{
			if (s[k] == s[j])
			{
				flag = 1;
				break;
			}
		}   //有重复flag=1||循环满了flag=0
		if (flag == 0) //循环满了  更新当前最大值
			max_tmp++;

		else   //字符有重复，更新i值，窗口滑动,更新窗口长度 ;更新flag
		{
			i = k + 1;
			max_tmp = j - i + 1;
			flag = 0;
		}
		if (max_tmp > max)	max = max_tmp;
		j++;
	}
	return max;

}