#

# @lc app=leetcode.cn id=3 lang=python

#

# [3] 无重复字符的最长子串

#

# https://leetcode-cn.com/problems/longest-substring-without-repeating-characters/description/

#

# algorithms

# Medium (29.78%)

# Likes: 1897

# Dislikes: 0

# Total Accepted: 135.1K

# Total Submissions: 453.3K

# Testcase Example: '"abcabcbb"'

#

# 给定一个字符串，请你找出其中不含有重复字符的 最长子串 的长度。

#

# 示例 1:

#

# 输入: "abcabcbb"

# 输出: 3

# 解释: 因为无重复字符的最长子串是 "abc"，所以其长度为 3。

#

#

# 示例 2:

#

# 输入: "bbbbb"

# 输出: 1

# 解释: 因为无重复字符的最长子串是 "b"，所以其长度为 1。

#

#

# 示例 3:

#

# 输入: "pwwkew"

# 输出: 3

# 解释: 因为无重复字符的最长子串是 "wke"，所以其长度为 3。

# 请注意，你的答案必须是 子串 的长度，"pwke" 是一个子序列，不是子串。

#

#

#

class Solution(object):

def lengthOfLongestSubstring(self, s):

"""

:type s: str

:rtype: int

"""

map = {}

j = 0

ret = 0

for i in range(len(s)):

if s[i] in map:

j = max(map[s[i]], j)

ret = max(ret, i - j + 1)

map[s[i]] = i + 1

return ret

print(Solution().lengthOfLongestSubstring('abcabcbb'))

print(Solution().lengthOfLongestSubstring('pwwkew'))

print(Solution().lengthOfLongestSubstring('bbbbb'))

print(Solution().lengthOfLongestSubstring(' '))

print(Solution().lengthOfLongestSubstring('dvdf'))

print(Solution().lengthOfLongestSubstring('abba'))