獲取字符串最長不重復子串

# coding:utf-8
def find_longest_no_repeat_substr(one_str):
    '''''
    找出來一個字符串中最長不重復子串
    '''
    res_list = []
    length = len(one_str)
    for i in range(length):#分別以字符串的每個字符作為自串的第一個字符
        tmp = one_str[i]#記錄不重復自串的中間變量
        for j in range(i + 1, length):
            if one_str[j] not in tmp:
                tmp += one_str[j]
            else:
                break
        res_list.append(tmp) #保存所有的不重復子串
    res_list.sort(lambda x, y: cmp(len(x), len(y)),reverse = True)#根據每個不重復子串長度降序排列
    return res_list[0]


if __name__ == '__main__':
    one_str_list = ['120135435', 'abdfkjkgdok', '123456780423349']
    for one_str in one_str_list:
        res = find_longest_no_repeat_substr(one_str)
        print   '{0}最長非重復子串為：{1}'.format(one_str, res)