Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4
, you should return the list as 2->1->4->3
.
Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed.
/**
* 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) {
ListNode* list=new ListNode(NULL);
ListNode* cur=list;
ListNode* temp=head;
while(temp && temp->next)
{
ListNode* tem=temp->next->next;
cur->next=temp->next;
cur=cur->next;
cur->next=temp;
cur=cur->next;
cur->next=NULL;
temp=tem;
}
if(temp!=NULL) cur->next=temp;
return list->next;
}
};
/**
* 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) {
ListNode* list=new ListNode(NULL);
ListNode* cur=list;
list->next=head;
ListNode* temp=head;
while(temp!=NULL && temp->next!=NULL)
{
ListNode* tem=temp->next->next;
ListNode* n=temp->next;
cur->next=n;
temp->next=tem;
n->next=temp;
cur=temp;
temp=tem;
}
if(temp!=NULL) cur->next=temp;
return list->next;
}
};