LeetCode 3. Longest Substring Without Repeating Characters

最长的不重复的子串

---

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

Example 1:

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

Example 2:

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

Example 3:

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.

这个问题跟之前找最大子数组的和有点像。

先把字母转成int存储在index中。找最大子串开始的地方，以及最大子串的长度。

---

C++版本。

#include<iostream>
#include<cstring>
using namespace std;
int lengthOfLongestSubstring(string s){
	//int index[200]={-1};//只初始化了index[0]
	int index[200];
	memset(index, -1, sizeof(index));
	int len = s.length();
	if(len<1) return len;
	int maxlength = -1;
	int maxbegin = 0; 
	for(int i=0;i<len;i++){
		maxbegin = max(maxbegin,index[int(s[i])]+1);
		maxlength = max(maxlength,i-maxbegin+1);
		index[int(s[i])]=i;
	} 
	return maxlength;
} 
int main(){
	string s;
	cin>>s;
	cout<<lengthOfLongestSubstring(s)<<endl;
	return 0;
}

其中初始化数组用int index[200]={-1}只是初始化了index[0]。

要用menset进行初始化，需要的头文件<cstring>

void * memset ( void * ptr, int value, size_t num );

不能用memset(index, -1, index);因为memset的内部实现是以字节为单位赋值 ,int类型大于一个字节，详见博客