longest substring

来源:互联网 发布:软件开发工作计划范文 编辑:程序博客网 时间:2024/05/27 21:50

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.

def lengthOfLongestSubstring(s):    used={}    start = max_length = 0    for i,c in enumerate(s):        if c in used and start<=used[c]:            start = used[c]+1        else:            max_length = max(max_length,i-start+1)        used[c]=i    return max_length
原创粉丝点击