3.无重复字符的最长子串

3.无重复字符的最长字串

法一：动态规划衍生法

法一：动态规划衍生 性能一般：224 ms 15 MB Python3
思路：以节点为终点遍历。
改进：以tmp=tmp[tmp.find(s[i])+1:]+s[i] 替代for循环。
性能较优：64 ms 15 MB Python3

class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        if s=='':
            return 0
        tmp=s[0]
        mx=s[0]
        for i in range(1,len(s)):
            if s[i] not in tmp:
                tmp+=s[i]
            else:
            	tmp=tmp[tmp.find(s[i])+1:]+s[i]
            	'''
            	#因为铁定只有唯一一个相同值，所以可直接用str.find(c)函数
                for j in range(len(tmp)-1,-1,-1):
                    if tmp[j]==s[i]:
                        tmp=tmp[j+1:]+s[i]
                        break
                 '''
            if len(tmp)>=len(mx):
                mx=tmp
        return len(mx)

法二：分治法–报错

class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        if len(s)==0:
            return 0
        else:
            max_left=self.lengthOfLongestSubstring(s[:len(s)//2])
            max_right=self.lengthOfLongestSubstring(s[len(s)//2:])
        tmp=s[len(s)//2-1]
        max_l=''
        max_r=""
        for i in range(len(s)//2-2,-1,-1):
            if s[i] not in tmp:
                tmp+=s[i]
            else:
                max_l=tmp
                break
        tmp=s[len(s)//2]
        max_r=""
        for i in range(len(s)//2+1,len(s)):
            if s[i] not in tmp:
                tmp+=s[i]
            else:
                max_r=tmp
                break
        max_mid=self.lengthOfLongestSubstring(max_l+max_r)
        return max(len(max_left),len(max_right),len(max_mid))

测试样例：“abcabcbb”
报错：

RecursionError: maximum recursion depth exceeded while calling a
Python object
if len(s)==0: Line 3 in lengthOfLongestSubstring (Solution.py)
max_left=self.lengthOfLongestSubstring(s[:len(s)//2]) Line 6 in lengthOfLongestSubstring (Solution.py) [Previous line repeated 995
more times]
max_right=self.lengthOfLongestSubstring(s[len(s)//2:]) Line 7 in lengthOfLongestSubstring (Solution.py)
max_right=self.lengthOfLongestSubstring(s[len(s)//2:]) Line 7 in lengthOfLongestSubstring (Solution.py)
max_right=self.lengthOfLongestSubstring(s[len(s)//2:]) Line 7 in lengthOfLongestSubstring (Solution.py)