Longests-Substring-Withuout-Repeating-Characters——python

# 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.

class Solution (object):
    def LengthOfLongestSubstring(self,s):
        """
        :type s:str
        :rtype:int
        """
        start = 0
        max_length = 0
        substring = {}
        for i, c in enumerate(s):
            if c in substring and start <= substring[c]:
                start = substring[c]+1
            else:
                max_length = max(max_length,i - start +1)
            substring[c] = i
        return max_length
发布了84 篇原创文章 · 获赞 30 · 访问量 7万+
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客

分享到微信朋友圈

×

扫一扫,手机浏览