描述
请从字符串中找出一个最长的不包含重复字符的子字符串,计算该最长子字符串的长度。
数据范围:
\ \text{s.length}\le 40000 s.length≤40000
# @param s string字符串
# @return int整型
#
class Solution:
def lengthOfLongestSubstring(self , s: str) -> int:
# write code here
res = 0
flag = False
if len(s) != 0:
i = 0#双指针1
j = 0#双指针2
while i < len(s):
for k in range(j,i):
if s[k] == s[i]:
flag = True
j = k + 1
break
if flag == False:
res = max(res,i-j+1)
i += 1
flag = False
return res
else:
return 0