Leetcode No. 234 && 206 Linked List basic Problem
Reverse Linked list # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def reverseList(self, head: ListNode) -> ListNode: prev = None curr = head while curr: nex = curr.next curr.next = prev prev = curr curr = nex return prev Linked List Palindrome # Definition for singly-linked list. # class ListNode..
Development/Algorithms
2020. 6. 9. 02:15
공지사항
최근에 올라온 글
최근에 달린 댓글
- Total
- Today
- Yesterday
링크
TAG
- 책리뷰
- Shell
- Fine-Tuning
- csv
- kubens
- book
- Container
- leetcode
- kubernetes context
- lllm
- K8S
- Gemma
- 파이썬
- docker
- 나는리뷰어다
- Kubernetes
- go
- Python
- LLM
- Git
- collator
- 키보드
- Algorithm
- 한빛미디어
- Binary
- AWS
- BASIC
- feed-forward
- palindrome
- error
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
글 보관함
반응형