zoukankan      html  css  js  c++  java
  • 003.无重复字符的最长子串

    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.

    给定一个字符串,找出不含有重复字符的最长子串的长度。

    示例:

    给定 "abcabcbb" ,没有重复字符的最长子串是 "abc" ,那么长度就是3。

    给定 "bbbbb" ,最长的子串就是 "b" ,长度是1。

    给定 "pwwkew" ,最长子串是 "wke" ,长度是3。请注意答案必须是一个子串,"pwke" 是 子序列  而不是子串

    思路:准备一个dict来存储每个字母最新的位置,出现重复的则记录下该字母的

    通俗版

    class Solution(object):
        def lengthOfLongestSubstring(self,s):
            temp = res = ''
            for item in s:
                if item not in temp:
                    temp += item
                    if len(temp) > len(res):
                        res = temp
                else:
                    i = temp.index(item)  # 找到该数据对应的索引
                    if i == len(temp) - 1:  # 如果找到尾部了
                        temp = item  # 重新复制temp
                    else:
                        temp = temp[i + 1:] + item
            return len(res)

    下面是最简洁版的

    def lengthOfLongestSubstring(s):
    	d = {}
    	start = 0
    	ans = 0
    	for i,c in enumerate(s):
    		if c in d:
    			start = max(start,d[c] + 1) # abba
    		d[c] = i
    		ans = max(ans,i - start + 1)
    	return ans
    print(lengthOfLongestSubstring('pwwkew'))
    关注公众号 海量干货等你
  • 相关阅读:
    小程序登录页面
    小程序环境搭建
    js闭包
    作用域和作用域链及预解析
    高阶函数
    在.net core项目中,增加gulp打包任务
    阿里云部署docker-swarm 内网问题
    .net identity scaffold
    c#中对XML反序列化
    c# Reactive Extension中的FromEventPattern和FromEvent
  • 原文地址:https://www.cnblogs.com/sowhat1412/p/12734325.html
Copyright © 2011-2022 走看看