从零开始的LC刷题(122): Swap Nodes in Pairs

原题；

Given a linked list, swap every two adjacent nodes and return its head.

You may not modify the values in the list's nodes, only nodes itself may be changed.

 

Example:

Given 1->2->3->4, you should return the list as 2->1->4->3.

链表元素两两交换，其实就是考察链表的操作，结果：

Success

Runtime: 0 ms, faster than 100.00% of C++ online submissions for Swap Nodes in Pairs.

Memory Usage: 8.5 MB, less than 100.00% of C++ online submissions for Swap Nodes in Pairs.

代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        if(head==nullptr||head->next==nullptr){return head;}
        ListNode* p=head;
        ListNode* q=p->next;
        p->next=q->next;
        q->next=p;
        head=q;
        q=p->next;
        while(q!=nullptr&&q->next!=nullptr){
            p->next=q->next;
            q->next=p->next->next;
            p->next->next=q;
            p=q;
            q=q->next;
        }
        return head;
    }
};