| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- data science
- 프로그래머스
- Python Implementation
- t1
- kaggle
- Generator
- Convert Sorted List to Binary Search Tree
- Substring with Concatenation of All Words
- concurrency
- 파이썬
- LeetCode
- Python
- 43. Multiply Strings
- Class
- 컴퓨터의 구조
- 30. Substring with Concatenation of All Words
- 715. Range Module
- 109. Convert Sorted List to Binary Search Tree
- attribute
- 시바견
- 315. Count of Smaller Numbers After Self
- shiba
- iterator
- 밴픽
- Python Code
- DWG
- 운영체제
- Protocol
- Regular Expression
- Decorator
Archives
- Today
- Total
목록Palindrome Linked List (1)
Scribbling
LeetCode: 234. Palindrome Linked List
Solution for Q.234 within O(N) time complexity and O(1) memory. To check whether it's a palindrome, we have to check two elements simultaneously from the head and tail. But in singly linked list, we have no way to check the elements in reverse order from the tail. So, the solution is simple. Reverse the second half of the list and compare two lists. Below is the code. # Definition for singly-lin..
Computer Science/Coding Test
2021. 12. 24. 12:40