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.程序代码：
int lengthOfLongestSubstring(char* s) { int len = 0,p=0,q=0,i; for(;q<strlen(s);q++) { for(i=p;i<q;i++) { if(s[q]==s[i]) { if(q-p>len) len = q-p; p=i+1; break; } } } len = len>(q-p)?len:q-p; return len;}新闻热点
疑难解答
