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.
class Solution {
public:
ListNode *swapPairs(ListNode *head) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
ListNode dummynode(0), *h = &dummynode, *p = head, *n,*temp;
h->next = head;
while(p){
n = p->next;
if (n){
h->next = n;
temp = n->next;
n->next = p;
p->next = NULL;
p = temp;
h = h->next;
h = h->next;
}else{
h->next = p;
break;
}
}
return dummynode.next;
}
};
原文链接: https://www.cnblogs.com/kwill/p/3189649.html
欢迎关注
微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍
原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/95816
非原创文章文中已经注明原地址,如有侵权,联系删除
关注公众号【高性能架构探索】,第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处!