本文共 633 字，大约阅读时间需要 2 分钟。

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.

代码如下：

class Solution {public:    int lengthOfLongestSubstring(string s) {        bool d[128] = { false };  		int max_len = 0;  		int start = 0;		int size = s.size();		char c;		for(int i=0; i
   
    i-start+1) ? max_len:i-start+1;   			} else {  				while(s[start] != c) {  					d[s[start]] = false;  					++start;  				}  				++start;  			}  		}  		return max_len;      }};
   

转载地址：http://ybxti.baihongyu.com/