leetcode 31 [LeetCode] 3. Longest Substring Without Repeating Characters I. Description문제 링크: https://leetcode.com/problems/longest-substring-without-repeating-characters/description/?envType=problem-list-v2&envId=hash-table&II. Codei)class Solution: def lengthOfLongestSubstring(self, s: str) -> int: left = max_len = 0 char_set = set() # right 포인터를 옮겨가며 for right in range(len(s)): # 중복 문자 나오면 중복 문자 없을 때까지 left 포인터 옮기기 .. 2024. 12. 5. 이전 1 다음
