首页 > 代码库 > Longest Substring Without Repeating Characters
Longest Substring Without Repeating Characters
题目如下:
Python代码:
class Solution(object): def lengthOfLongestSubstring(self, s): """ :type s: str :rtype: int """ string = [] length = 0 max = 0 for i in range(len(s)): if s[i] not in string: string.append(s[i]) else: pos = string.index(s[i]) if pos<len(string)-1: string = string[string.index(s[i])+1:] else: string = [] string.append(s[i]) if len(string)>max: max = len(string) return max
Longest Substring Without Repeating Characters
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。