| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | |
| 7 | 8 | 9 | 10 | 11 | 12 | 13 |
| 14 | 15 | 16 | 17 | 18 | 19 | 20 |
| 21 | 22 | 23 | 24 | 25 | 26 | 27 |
| 28 | 29 | 30 | 31 |
Tags
- 30. Substring with Concatenation of All Words
- 밴픽
- data science
- LeetCode
- 프로그래머스
- 컴퓨터의 구조
- kaggle
- Python Implementation
- 시바견
- 315. Count of Smaller Numbers After Self
- Python
- 109. Convert Sorted List to Binary Search Tree
- 43. Multiply Strings
- t1
- Generator
- 파이썬
- 715. Range Module
- Convert Sorted List to Binary Search Tree
- shiba
- attribute
- concurrency
- Decorator
- Class
- Python Code
- 운영체제
- Protocol
- iterator
- Regular Expression
- Substring with Concatenation of All Words
- DWG
Archives
- Today
- Total
목록3. Longest Substring Without Repeating Characters (1)
Scribbling
LeetCode: 3. Longest Substring Without Repeating Characters
class Solution: def lengthOfLongestSubstring(self, s: str) -> int: char_set = set() l = 0 max_len = 0 for r in range(len(s)): if s[r] in char_set: while s[r] in char_set: char_set.remove(s[l]) l += 1 char_set.add(s[r]) max_len = max(max_len, r - l + 1) return max_len
Computer Science/Coding Test
2021. 8. 11. 17:23