| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- t1
- DWG
- Python
- 30. Substring with Concatenation of All Words
- Protocol
- 컴퓨터의 구조
- 43. Multiply Strings
- Regular Expression
- 밴픽
- LeetCode
- 파이썬
- shiba
- Convert Sorted List to Binary Search Tree
- Python Implementation
- Generator
- 715. Range Module
- iterator
- kaggle
- 109. Convert Sorted List to Binary Search Tree
- 315. Count of Smaller Numbers After Self
- attribute
- concurrency
- data science
- Class
- 시바견
- Substring with Concatenation of All Words
- Python Code
- 프로그래머스
- Decorator
- 운영체제
Archives
- Today
- Total
목록61. Rotate List (1)
Scribbling
LeetCode: 61. Rotate List
# Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def rotateRight(self, head: Optional[ListNode], k: int) -> Optional[ListNode]: if not head: return count, cur, prv = 0, head, None while cur != None: prv = cur count += 1 cur = cur.next tail = prv k %= count if k == 0: return head cur = head for i in ..
Computer Science/Coding Test
2021. 9. 24. 16:40