只允许使用一个申请空间,申请一个pre节点指向head节点,用指针交换,如果pre后存在两个节点就进行一次指针交换操作
/**
* 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* pre = new ListNode(INT_MIN);
pre->next = head;
head = pre;
while(pre->next!=nullptr){
if(pre->next->next!=nullptr){
ListNode* p = pre->next->next->next;
pre->next->next->next = pre->next;
pre->next = pre->next->next;
pre->next->next->next = p;
pre = pre->next->next;
}
else{
pre = pre->next;
}
}
return head->next;
}
};