hyunkookim 님의 블로그

92. Reverse Linked List II GPT 코드# Definition for singly-linked list.# class ListNode:# def __init__(self, val=0, next=None):# self.val = val# self.next = nextclass Solution: def reverseBetween(self, head: Optional[ListNode], left: int, right: int) -> Optional[ListNode]: # Step 1: Dummy 노드 생성 (head가 바뀌는 경우를 처리하기 위해) dummy = ListNode(0) dummy.next = hea..

138. Copy List with Random Pointer https://youtu.be/5Y2EiZST97Y?si=24I-c_Obsw9-9vYx """# Definition for a Node.class Node: def __init__(self, x: int, next: 'Node' = None, random: 'Node' = None): self.val = int(x) self.next = next self.random = random"""class Solution: def copyRandomList(self, head: 'Optional[Node]') -> 'Optional[Node]': if not head: r..

21. Merge Two Sorted Lists # Definition for singly-linked list.# class ListNode:# def __init__(self, val=0, next=None):# self.val = val# self.next = nextclass Solution: def mergeTwoLists(self, list1: Optional[ListNode], list2: Optional[ListNode]) -> Optional[ListNode]: dummy = ListNode() res = dummy while list1 and list2: v1 = list1...

2. Add Two Numbers https://youtu.be/wgFPrzTjm7s?si=DGP0R4iCDigdI7GY https://youtu.be/oRVhdwpTbdU?si=SVZBd8Gq4JuCsoDP # Definition for singly-linked list.# class ListNode:# def __init__(self, val=0, next=None):# self.val = val# self.next = nextclass Solution: def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]: # The digits a..