https://leetcode.com/problems/reverse-linked-list/
Reverse Linked List - LeetCode
Reverse Linked List - Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: [https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg] Input: head = [1,2,3,4,5] Output: [5,4,3,2,1] Example 2: [https://asset
leetcode.com
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
|
# 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: Optional[ListNode]) -> Optional[ListNode]:
node, prev = head, None
while node:
next, node.next = node.next, prev
prev, node = node, next
return prev
|
cs |
node.next를 이전 prev 리스트로 계속 연결하면서 끝날때까지 반복.
Continue linking node.next to the previous prev list, repeating until the end.
반응형
'python-algorithm' 카테고리의 다른 글
| leetcode 24. Swap Nodes in Pairs (0) | 2023.02.17 |
|---|---|
| leetcode 2. Add Two Numbers (0) | 2023.02.17 |
| 백준 9772 Quadrants (0) | 2023.02.17 |
| leetcode 989. Add to Array-Form of Integer (0) | 2023.02.15 |
| leetcode 21. Merge Two Sorted Lists (0) | 2023.02.13 |
댓글