| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- DWG
- Convert Sorted List to Binary Search Tree
- Python Code
- Substring with Concatenation of All Words
- Decorator
- 프로그래머스
- 시바견
- 컴퓨터의 구조
- Class
- 파이썬
- 315. Count of Smaller Numbers After Self
- kaggle
- shiba
- 43. Multiply Strings
- data science
- Generator
- attribute
- 운영체제
- Python
- iterator
- 109. Convert Sorted List to Binary Search Tree
- Protocol
- 30. Substring with Concatenation of All Words
- Regular Expression
- t1
- concurrency
- Python Implementation
- LeetCode
- 715. Range Module
- 밴픽
Archives
- Today
- Total
목록86. Partition List (1)
Scribbling
LeetCode: 86. Partition List
간단하면서도 재밌는 문제 # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def partition(self, head: Optional[ListNode], x: int) -> Optional[ListNode]: smaller_train = ListNode() s_ptr = smaller_train bigger_train = ListNode() b_ptr = bigger_train cur = head while cur != None: if cur.val < x: s_ptr.next = cur s..
Computer Science/Coding Test
2021. 10. 6. 16:26