剑指offer_48 最长不含重复字符的子字符串

文章目录

1. 描述

2. 代码

# 滑动窗口思想
def MaxSubStr(s):
    res = ''
    sub_s = ''

    for i in range(len(s)):
		# 查找字符是否在sub_s中
        pos = sub_s.find(s[i])

        if pos != -1:
            sub_s = sub_s[pos+1:]

        sub_s +=s[i]

        if len(sub_s) > len(res):
            res = sub_s

    return res

str_list = ['', 'c', 'dd', 'abcdef', 'abccdeffg', 'abacbefkb', 'dvdf']
for str in str_list:
    res = MaxSubStr(str)
    print('res:{}, len:{}'.format(res, len(res)))

结果

res:, len:0
res:c, len:1
res:d, len:1
res:abcdef, len:6
res:cdef, len:4
res:acbefk, len:6
res:vdf, len:3

Guess you like

Origin blog.csdn.net/qq_35632833/article/details/119432989