首页 > 代码库 > [LeetCode]3. Longest Substring Without Repeating Characters
[LeetCode]3. Longest Substring Without Repeating Characters
3. Longest Substring Without Repeating Characters
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 a substring, "pwke" is a subsequence and not a substring.
题意：
给定一个字符串，找出最长的无重复的连续字串。就比如"pwwkew"的最长无重复连续字串是"wke"。
最易想到的方法就是字符串逐一开始查找，第一个字符串找到最长的字串，依次找出，取最大值即可。
由于有256个字符，故定义了个257长度的数组，足以存下所有字符。
思路
1）定义字符数组，并把256个的值都置为零。
2）逐个查找字符，如果未出现过，即把该下标对应的数组值置为一。若该下标值已经是一了，则返回，
3）重置全部数组元素元素为零，从下个下标开始继续查找不重复字串。
4）返回最大字串长度即可。
#define CHARACTERS 257
int lengthOfLongestSubstring(char* s)
{
if ( !s )
{
return 0;
}
int character[CHARACTERS] = { 0 };
int len = strlen(s);
int cnt = 0;
int size = 0;
int maxLen = 0;
int index = 0;
for ( index = 0; index < len; index++ )
{
size = 0;
for ( cnt = 0; cnt < CHARACTERS; cnt++ )
{
character[cnt] = 0;
}
for ( cnt = index; cnt < len; cnt++ )
{
/* pwwkew */
int value = *(s + cnt);
if ( character[value] == 0 )
{
size += 1;
character[value] = 1;
}
else
{
break;
}
}
if ( size > maxLen )
{
maxLen = size;
}
}
return maxLen;
}[LeetCode]3. Longest Substring Without Repeating Characters
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。