[LeetCode] 24. Swap Nodes in Pairs - 문제풀이
Description 인접한 두개의 노드끼리 swap하여 반환하는 문제입니다. Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes (i.e., only nodes themselves may be changed.) Example 1: Input: head = [1,2,3,4] Output: [2,1,4,3] Example 2: Input: head = [] Output: [] Example 3: Input: head = [1] Output: [1] Constraints: The number of ..
