leetcode24. Swap Nodes in Pairs

站在风口的熊

于 2017-11-06 17:34:49 发布

阅读量254

点赞数

分类专栏： leetcode&poj 文章标签： leetcode

本文链接：https://blog.csdn.net/barebear007/article/details/78459945

版权

leetcode&poj 专栏收录该内容

83 篇文章 0 订阅

订阅专栏

leetcode24. Swap Nodes in Pairs

class Solution {
public:
    ListNode* swapPairs(ListNode* head) {
        int step = 2;
        ListNode *front = new ListNode(0);
        front->next = head;
        ListNode *tail = front;

        ListNode *lHead = front;
        if(head==NULL){
            return NULL;
        }
        if(head->next==NULL){
            return head;
        }
        while(tail->next!=NULL){
            tail = tail->next;
            if(step<=1){ 
                front->next->next = tail->next;
                tail->next = front->next;
                front->next = tail;
                tail = tail->next;
                front = tail;
                step = 2;
            }else{

                step--;
            }
        }
        return lHead->next;


    }
};