본문 바로가기

Leet Code 206. Reverse Linked List

[Python] Leet Code 206. 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, lst: ListNode) -> ListNode: node, prev = lst, None while node: next, node.next = node.next, prev prev, node = node, next return prev def toList(self, node: ListNode) -> List: list: List = [] while node: lis.. 더보기
[Python] Leet Code 206. 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: def reverse(node: ListNode, prev: ListNode = None): if not node: return prev next, node.next = node.next, prev return reverse(next, node) return reverse(head) 이 문제에서 배워야 할 포.. 더보기

티스토리툴바