기록하는 공간

Middle of the Linked List - LeetCode Middle of the Linked List - Given the head of a singly linked list, return the middle node of the linked list. If there are two middle nodes, return the second middle node. Example 1: [https://assets.leetcode.com/uploads/2021/07/23/lc-midlist1.jpg] Inpu leetcode.com # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None):..

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 # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # sel..

Merge Two Sorted Lists - LeetCode Merge Two Sorted Lists - You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list. leetcode.com # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None):..