[3] Longest Substring Without Repeating Characters | Leetcode Medium
🔎 問題の説明
Given a string s, find the length of the longest substring without repeating characters.
Example 1
Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.Input: s = "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.Input: s = "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.
Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.制限条項のため、暴力を振るうとタイムアウトする可能性があります.これはちょっと難しい問題です.
🧊 Pythonコード
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
save = []
max_len = 0
for x in s:
if x in save:
save = save[save.index(x)+1:]
save.append(x)
max_len = max(max_len, len(save))
return max_lenReference
この問題について([3] Longest Substring Without Repeating Characters | Leetcode Medium), 我々は、より多くの情報をここで見つけました https://velog.io/@yoongyum/3-Longest-Substring-Without-Repeating-Characters-Leetcode-Mediumテキストは自由に共有またはコピーできます。ただし、このドキュメントのURLは参考URLとして残しておいてください。
Collection and Share based on the CC Protocol