LeetCode 24 两两交换链表中的节点（图解）

题目

代码实现

代码与文尾的图解一起食用，更香哦！

Java

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode swapPairs(ListNode head) {
        int len = getLength(head);
        if(len < 2){
            return head;
        }else{
            ListNode node = new ListNode();
            node.val = 0;
            node.next = head;
            ListNode cur = node;
            while(cur.next != null && cur.next.next != null){
                ListNode no1 = cur.next;
                ListNode no2 = cur.next.next;
                cur.next = no2;
                no1.next = no2.next;
                no2.next = no1;
                cur = no1;
            }
            return node.next;
        }
    }
    public int getLength(ListNode head){
        int len = 0;
        while(head != null){
            len++;
            head = head.next;
        }
        return len;
    }
}

C

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
int getLength(struct ListNode* head){
    int len = 0;
    while(head != NULL){
        len++;
        head = head->next;
    }
    return len;
}

struct ListNode* swapPairs(struct ListNode* head){
    int len = getLength(head);
    if(len < 2){
        return head;
    }else{
        struct ListNode* node = malloc(sizeof(struct ListNode));
        node->val = 0;
        node->next = head;
        struct ListNode* cur = node;
        while(cur->next != NULL && cur->next->next != NULL){
            struct ListNode* no1 = cur->next;
            struct ListNode* no2 = cur->next->next;
            cur->next = no2;
            no1->next = no2->next;
            no2->next = no1;
            cur = no1;
        }
        return node->next;
    }
}

此处为图解换位过程