leet code 从500ms 优化到6ms

最新推荐文章于 2024-09-25 09:59:34 发布

weixin_34150830

最新推荐文章于 2024-09-25 09:59:34 发布

阅读量54

点赞数

文章标签： python

原文链接：https://my.oschina.net/mummy108/blog/776250

版权

2019独角兽企业重金招聘Python工程师标准>>>



#include <stdio.h>
#include <windows.h>
#include <string.h>
#include <stdbool.h>

int lengthOfLongestSubstring(char* s) {
	bool isChecked[256];
	
	int index_start = 0;
	int index_end = 0;
	int max_cnt = 0;
	int current_cnt = 0;
	memset(isChecked, false, 256);
	char target_end = s[index_end];

	while (target_end != '\0')
	{
		if (!isChecked[target_end])
		{
			isChecked[target_end] = true;
			current_cnt++;
			index_end++;
			target_end = s[index_end];
		}
		else
		{
			if (current_cnt > max_cnt)
			{
				max_cnt = current_cnt;
			}
			char target_start = s[index_start];
			while (target_start != target_end)
			{
				index_start++;
				isChecked[target_start] = false;
				current_cnt--;
				target_start = s[index_start];
			}
			index_start++;
			index_end++;
			target_end = s[index_end];
		}
	}			
	if (current_cnt > max_cnt)
	{
		max_cnt = current_cnt;
	}
	return max_cnt;
}


int main(void)
{
	char* p_str = "abbaaaaaabcdaabcdeaa";
	printf("hello,world\r\n");
	printf("%s,%d\r\n", p_str, lengthOfLongestSubstring(p_str));
	system("pause");
}
https://leetcode.com/submissions/detail/80152054/

转载于:https://my.oschina.net/mummy108/blog/776250