最长不包含重复字符的子字符串【python】

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/weixin_36372879/article/details/84861449

题目描述
请从字符串中找出一个最长的不包含重复字符的子字符串，计算该最长子字符串的长度。例如在“arabcacfr”中，最长的不包含重复字符的子字符串是“acfr”，长度为4
采用字典的方法，最后输出所有最长字符的列表

class Solution:
    def __init__(self):
        self.maxString = []
    def longestSubString(self, inputString):
        if inputString == '':
            return ''
        dic = {}
        dic = dic.fromkeys(inputString, 0)
        self.maxString.append(inputString[0])
        for i in range(len(inputString)):
            for j in range(i, len(inputString)):
                if dic[inputString[j]] != 0:
                    dic = dic.fromkeys(inputString, 0)
                    break
                else:
                    if j - i + 1 > len(self.maxString[0]):
                        self.maxString = []
                        self.maxString.append(inputString[i:j+1])
                    elif j - i + 1 == len(self.maxString[0]):
                        self.maxString.append(inputString[i:j+1])
                    dic[inputString[j]] += 1

inputString = 'arabcacfr'
sol = Solution()
sol.longestSubString(inputString)
print(sol.maxString)
输出：['rabc', 'acfr']