_24. Swap Nodes in Pairs.md

24. Swap Nodes in Pairs

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : June 07, 2024

Last updated : July 01, 2024

---

Related Topics : Linked List, Recursion

Acceptance Rate : 64.816 %

---

Solutions

• m24 v2 recursion.c
• m24.c

C

m24 v2 recursion.c

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* swapPairs(struct ListNode* head) {
    if (!head || !head->next) {
        return head;
    }

    // Swap of list[0] and list[1]
    struct ListNode* outputHead = head->next;
    head->next = swapPairs(outputHead->next); // Recurse for next 2
    outputHead->next = head;

    return outputHead;
}

m24.c

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* swapPairs(struct ListNode* head) {
    if (!head || !head->next) {
        return head;
    }

    // Swap of list[0] and list[1]
    struct ListNode* headPointer = head->next; // Store output head
    head->next = head->next->next;
    headPointer->next = head;

    // Starting reference nodes list[1], list[2]
    struct ListNode* pointerL = head;
    struct ListNode* pointerR = head->next;

    while (pointerR && pointerR->next) {
        pointerL->next = pointerR->next;
        pointerR->next = pointerR->next->next;

        pointerL->next->next = pointerR;

        // Reference nodes are now list[L+2], list[R+2] i.e. shift right by 2
        pointerL = pointerL->next->next;
        pointerR = pointerR->next;
    }

    return headPointer;
}