您的位置:首页 > 编程语言 > Python开发

leetcode python - Longest Substring Without Repeating Characters

2017-04-01 15:07 656 查看
# Given a string, find the length of the longest substring without repeating characters.
#
# Examples:
#
# Given "abcabcbb", the answer is "abc", which the length is 3.
#
# Given "bbbbb", the answer is "b", with the length of 1.
#
# Given "pwwkew", the answer is "wke", with the length of 3.
# Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
#
class Solution(object):
def lengthOfLongestSubstring(self, s):
"""
:type s: str
:rtype: int
"""
i,j,k = 0,0,0
map = {}
while i < len(s) and j < len(s):
if map.has_key(s[j]):
i = max(i, map[s[j]] + 1)
map[s[j]] = j
k = max(k, j - i + 1)
j += 1
return k
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: 
相关文章推荐