题目描述
Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given1->2->3->4, you should return the list as2->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.
同翻转k个结点相同;
实现代码:
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
int getListlength(ListNode* head)//得到链表的长度
{
int count=0;
while(head)
{
head=head->next;
count++;
}
return count;
}
ListNode *swapPairs(ListNode *head) {
int length=getListlength(head);
ListNode* pfNode=new ListNode(-1); //初始结点
ListNode* pNode=pfNode; //用于每次的头结点移动;
while(length>=2)
{
ListNode* oldnode=NULL; //反转前初始化为空
for(int i=0;i<2;i++)
{
ListNode* newnode=head;
head=head->next;
newnode->next=oldnode; //将新节点放在旧结点前;
oldnode=newnode; //将新节点作为旧结点,便于下次连接;
}
pNode->next=oldnode;//将翻转结果加入到头结点后面
while(pNode->next)
pNode=pNode->next; //头结点发生移动;
length-=2; //每翻转一次就更新剩余长度;
}
pNode->next=head;
return pfNode->next;
}
};