两两交换链表中的节点
carl原文:两两交换链表中的节点
/**
* 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) {}
* };
*/
//要用cur一直串下去
class Solution {
public:
ListNode* swapPairs(ListNode* head) {
ListNode* newhead = new ListNode(0);
newhead -> next = head;
ListNode* cur = newhead;
while((cur->next != nullptr ) && (cur -> next -> next != nullptr)) {
ListNode* temp = cur -> next;
ListNode* temp1 = cur -> next ->next ->next;
cur -> next = cur -> next ->next;
cur -> next -> next = temp;
cur -> next -> next -> next = temp1;
cur = cur -> next ->next;
}
return newhead -> next;
}
};