Leecode 24. 两两交换链表中的节点

Leecode 24. 两两交换链表中的节点

struct ListNode {
      int val;
      ListNode *next;
      ListNode(int x) : val(x), next(NULL) {}
  };
  
 
class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        if (head == NULL || head -> next == NULL) {
            return head;
        }
        ListNode *p = head;
        ListNode *q = head->next;
        
        p->next = q->next;
        q->next = p;

        ListNode *first = q;
        ListNode *pre = p;
        while(p->next!=NULL) {
            p = p->next;
            if (p->next == NULL) {
                break;
            } 
            q = p->next;
            
            p->next = q->next;
            pre->next = q;
            q->next = p;
            pre = p;
        }
        return first;

    }
};
	```