Leetcode Longest Substring Without Repeating Characters Python 找到字符串中重复次数最多的字符长度

Leetcode 第3题 Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.

Example 1:

Input: "abcabcbb"
Output: 3 
Explanation: The answer is "abc", with the length of 3. 

Example 2:

Input: "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.

Example 3:

Input: "pwwkew"
Output: 3
Explanation: 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.

---

题目大意： 从一个字符串中找到重复次数最多的最长字符，并且返回它的长度。 应该是默认肯定有重复的，所以没有考虑不重复的情况。比如说"a-z"。

这里需要考虑两个核心问题：

1. 如何保存这个重复的字符(串)。
2. 如何确认这个重复字符是在所有重复字符中最长的。

上代码：

class Solution():
    def lengthOfLongestSubstring(self, s: str) -> int:
        seen = ''
        mx = 0
        for i in s:
            if i not in seen:
                seen += i
            else:
                seen = seen[seen.index(i) + 1:] + i
            mx = max(mx,len(seen))
        return mx

用字符串变量seen来保要判断是否循环的字符串，用mx判断循环的字符串是否为最长。每次更新。

英国也要示威了，
加油！
02/06/2020