代码:
class Solution:
def maxLength(self , arr ):
new = []
number = []
maxlen = 0
i = 0
while i<len(arr):
if arr[i] not in new:
new.append(arr[i])
number.append(i)
i = i+1
else:
maxlen = max(maxlen, len(new))
temp = 0
for j in range(0,len(new)):
if new[j]== arr[i]:
temp = j
i = number[temp]+1
new = []
number = []
maxlen = max(maxlen, len(new))
return maxlen
修改代码:
class Solution:
def maxLength(self , arr ):
new = []
number = []
maxlen = 0
i = 0
while i<len(arr):
if arr[i] not in new:
new.append(arr[i])
number.append(i)
i = i+1
else:
maxlen = max(maxlen, len(new))
temp = new.index(arr[i]) #python中.index()直接获取编号
i = number[temp]+1
new = []
number = []
maxlen = max(maxlen, len(new))
return maxlen