| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- 시바견
- concurrency
- 프로그래머스
- Generator
- Decorator
- 315. Count of Smaller Numbers After Self
- 운영체제
- shiba
- 밴픽
- 컴퓨터의 구조
- data science
- attribute
- 109. Convert Sorted List to Binary Search Tree
- Class
- Substring with Concatenation of All Words
- 30. Substring with Concatenation of All Words
- iterator
- Python Code
- t1
- DWG
- Convert Sorted List to Binary Search Tree
- kaggle
- Python Implementation
- 파이썬
- 43. Multiply Strings
- Python
- Regular Expression
- 715. Range Module
- Protocol
- LeetCode
Archives
- Today
- Total
목록125. Valid Palindrome (1)
Scribbling
LeetCode: 125. Valid Palindrome
class Solution: def isPalindrome(self, s: str) -> bool: s = s.lower().strip() if not s: return True l, r = 0, len(s) - 1 while l < r: if not s[l].isalnum(): l += 1 continue if not s[r].isalnum(): r -= 1 continue if s[l] != s[r]: return False l += 1 r -= 1 return True
Computer Science/Coding Test
2021. 12. 20. 12:35