leetcode-Longest Substring Without Repeating Characters

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.

题意：给出一个字符串，找到最长的连续子串，满足子串中没有重复字符

分析：遍历字符串，记录以当前位置的前一个位置i-1为结尾的最长不重复子串的起始位置start，维护一个不重复子串区间[start,i-1]，用映射表w[s[i]]记录当前字符s[i]上一次在字符串中出现的位置

若w[s[i]]>=start，证明当前字符在当前维护的不重复子串中出现，更新子串长度为i-w[s[i]]+1，更新区间起始位置为w[s[i]]+1

否则，区间长度+1，更新最长子串的值

代码：

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
    	int w[310];
    	memset(w,0,sizeof(w));
		int len = s.length();
		
		if(len==0) return 0;
		
		int ans=1,now=1,start=1;
		w[s[0]] = 1;
		for(int i=1; i<len; i++)
		{
			if(w[s[i]]>=start)
			{
				now = i-w[s[i]]+1;
				start = w[s[i]];
			}
			else
			{
				now++;
				if(now>ans) ans=now;
			}
			w[s[i]] = i+1;
		}
		return ans;
    }
};