python实现最长不重复子串并打印

class Solution():
    def longest_str(self, array):
        arr = []
        total = []
        for i in range(len(array)):
            arr2 = array[i] 
            num = 1
            for j in range(i+1,len(array)):     
                if array[j] not in arr2:
                    arr2+=array[j]
                    num+=1
                else:
                    break
            arr.append(arr2)
            total.append(num)
        result = total.index(max(total))
        return arr[result]
a = Solution()
arra = '120135435'
a.longest_str(arra)