给定一个字符串,请你找出其中不含有重复字符的 最长子串 的长度。
示例 1:
输入: "abcabcbb"
输出: 3
解释: 因为无重复字符的最长子串是 "abc",所以其长度为 3。
示例 2:输入: "bbbbb"
输出: 1
解释: 因为无重复字符的最长子串是 "b",所以其长度为 1。
示例 3:输入: "pwwkew"
输出: 3
解释: 因为无重复字符的最长子串是 "wke",所以其长度为 3。
请注意,你的答案必须是 子串 的长度,"pwke" 是一个子序列,不是子串。
# 解法一:滑动窗口
class Solution(object):
def lengthOfLongestSubstring(self, s):
"""
:type s: str
:rtype: int
"""
start = 0
res_l = 0
for i, val in enumerate(s):
if val in s[start:i]:
start = start + 1 + s[start:i].index(val)
else:
res_l = max(res_l, i - start + 1)
return res_l
# 解法二:优化的滑动窗口(40ms)
class Solution(object):
def lengthOfLongestSubstring(self, s):
"""
:type s: str
:rtype: int
"""
"""
优化的滑动窗口
"""
start = 0
res_l = 0
map_dict = {}
for i, val in enumerate(s):
if val in map_dict:
start = max(map_dict[val], start)
map_dict[val] = i + 1
res_l = max(res_l, i - start + 1)
return res_l
# 解法三:优化的滑动窗口(24ms)
class Solution(object):
def lengthOfLongestSubstring(self, s):
"""
:type s: str
:rtype: int
"""
dct = {}
max_so_far = curr_max = start = 0
for index, i in enumerate(s):
if i in dct and dct[i] >= start:
max_so_far = max(max_so_far, curr_max)
curr_max = index - dct[i]
start = dct[i] + 1
else:
curr_max += 1
dct[i] = index
return max(max_so_far, curr_max)