题目:
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.
解题思路:
设置一个辅助数据结构dict,记录每个字符最后一次出现的位置;变量cur记录上次出现重复字符的位置;res位不重复子串长度
(1)遍历字符串中的每个字符,如果字符x在dict中没有出现,更新最大字符串的长度值为max(res,i-cur);
(2)如果字符x在dict中已经出现过且x的上一次出现的位置大于cur,则更新cur为上一次x 的出现位置。并更新x的位置数。更新最大字符串的长度值为max(res,i-cur);
class Solution:
# @param {string} s
# @return {integer}
def lengthOfLongestSubstring(self, s):
dict = {}
res,cur = 0,-1
for i,c in enumerate(s):
if c in dict and dict[c]>cur:
cur = dict[c]
dict[c] = i
res = max(res,i-cur)
return res