003 - Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters

My Submissions

Question

Total Accepted: 105949 Total Submissions: 512162 Difficulty: Medium

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.

Subscribe to see which companies asked this question

 

找出给定字符串的一个最长子串，这个子串的特点是没有重复字母，返回子串长度

 

我的想法是：遍历字符串，把每个字符的最长子串长度记录下来，但剩余的字符串长度小于等于这个最长子串长度就退出循环

计算最长子串长度：用一个字符数组保留已查找到的最大不重复长度，下次查找是可以直接跳过这些已查找过的

 

void setcurmax(char *s, int slen, int cur, char *allc, int *maxlen, int *his)
{
	int i;
	if (cur > 0) {
		allc[s[cur - 1]] = 0;
		*maxlen -= 1;
	}
	for (i = cur + *maxlen; i < slen; i++) {
		if (!allc[s[i]]) {
			allc[s[i]] = 1;
			*maxlen += 1;
		} else
			break;
	}

	if (*maxlen > *his) *his = *maxlen;
}
int lengthOfLongestSubstring(char* s) 
{
	char allc[256] = {0};
	int maxlen = 0;
	int i, his = 0;
	int slen = strlen(s);
	for (i = 0; slen - i > maxlen; i++) {
		setcurmax(s, slen, i, allc, &maxlen, &his);
	}
	return his;
}