1721. Swapping Nodes in a Linked List
Medium
30 Points
Linked List
Two Pointers
You are given the head of a linked list, and an integer k.
Return the head of the linked list after swapping the values of the kth node from the beginning and the kth node from the end (the list is 1-indexed).
Examples
Example 1
Input: head = [1,2,3,4,5], k = 2
Output: [1,4,3,2,5]
Example 2
Input: head = [7,9,6,6,7,8,3,0,9,5], k = 5
Output: [7,9,6,6,8,7,3,0,9,5]
Constraints
The number of nodes in the list is n.1 <= k <= n <= 1050 <= Node.val <= 100
1721. Swapping Nodes in a Linked List
Medium
30 Points
Linked List
Two Pointers
You are given the head of a linked list, and an integer k.
Return the head of the linked list after swapping the values of the kth node from the beginning and the kth node from the end (the list is 1-indexed).
Examples
Example 1
Input: head = [1,2,3,4,5], k = 2
Output: [1,4,3,2,5]
Example 2
Input: head = [7,9,6,6,7,8,3,0,9,5], k = 5
Output: [7,9,6,6,8,7,3,0,9,5]
Constraints
The number of nodes in the list is n.1 <= k <= n <= 1050 <= Node.val <= 100