码迷,mamicode.com
首页 > 其他好文 > 详细

24. Swap Nodes in Pairs

时间:2018-05-18 00:35:22      阅读:168      评论:0      收藏:0      [点我收藏+]

标签:AC   ack   return   hang   pairs   pad   pac   space   ==   


Given a linked list, swap every two adjacent nodes and return its head.

Example:

Given 1->2->3->4, you should return the list as 2->1->4->3.

Note:

  • Your algorithm should use only constant extra space.
  • You may not modify the values in the list‘s nodes, only nodes itself may be changed.


struct ListNode* swapPairs(struct ListNode* head) {
  struct ListNode * p = head;
  if(head == NULL || head->next==NULL) {
    return head;
  }
  struct ListNode * q = NULL;
  struct ListNode * prev = NULL;
  head=head->next;
  while(p != NULL && p->next != NULL) {
    q = p->next;
    p->next = p->next->next;
    q->next = p;
    if(prev != NULL) {
      prev->next = q;
    }
    prev = p;
    p=p->next;
  }
  return head;
}

24. Swap Nodes in Pairs

标签:AC   ack   return   hang   pairs   pad   pac   space   ==   

原文地址:https://www.cnblogs.com/tuhooo/p/9053887.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!