1721. Swapping Nodes in a Linked List

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).

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* swapNodes(ListNode* head, int k) {
        ListNode* lastNode = head;
        ListNode* target1 = head;
        ListNode* target2 = head;
        
        for(int i = 1; i < k; i++) {
            lastNode = lastNode->next;
            target1 = target1->next;
        }
        
        while(lastNode->next != nullptr) {
            lastNode = lastNode->next;
            target2 = target2->next;
        }
        swap(target1->val, target2->val);

        return head;
    }
};