24. Swap Nodes in Pairs
Medium
Last updated
Medium
Last updated
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:
Example 2:
Example 3:
Constraints:
The number of nodes in the list is in the range [0, 100]
.
0 <= Node.val <= 100
Run time beat 100%、不需要做 Recursion,時間複雜度是O(n)的解法~