| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- 파이썬
- iterator
- 운영체제
- 밴픽
- 프로그래머스
- Substring with Concatenation of All Words
- 30. Substring with Concatenation of All Words
- data science
- DWG
- 시바견
- Convert Sorted List to Binary Search Tree
- shiba
- Python Implementation
- 43. Multiply Strings
- Protocol
- 컴퓨터의 구조
- 315. Count of Smaller Numbers After Self
- Decorator
- Python Code
- Generator
- Python
- LeetCode
- Regular Expression
- 715. Range Module
- attribute
- t1
- kaggle
- 109. Convert Sorted List to Binary Search Tree
- concurrency
- Class
Archives
- Today
- Total
목록143. Reorder List (1)
Scribbling
LeetCode: 143. Reorder List
Recursion을 이용한 방법 # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def reorderList(self, head: Optional[ListNode]) -> None: """ Do not return anything, modify head in-place instead. """ cur = head count = 0 while cur != None: count += 1 cur = cur.next new_head, _ = self.helper(head, count) return ne..
Computer Science/Coding Test
2021. 11. 22. 10:49