LeetCode 92. Reverse Linked List II

题解

反转链表大家都会写，但是怎样写得优雅简洁是个问题。
这题要求反转一定区间的链表，有一点注意就是起点可能是头结点。
pre有可能是null，这不优雅，所以我们新建一个New_head节点代表一个
虚拟的头部让这个New_head->next = head，最后只要return New_head->next就好了。

ps:下面贴了两种反转实现，比较一下。

Code

冒泡式反转链表

ListNode* reverseBetween(ListNode* head, int m, int n) {
        ListNode* new_head = new ListNode(0);
        new_head -> next = head;
        ListNode* pre = new_head;
        for (int i = 0; i < m - 1; i++)
            pre = pre -> next;
        ListNode* cur = pre -> next;
        for (int i = 0; i < n - m; i++) {
            ListNode* move = cur -> next; 
            cur -> next = move -> next;
            move -> next = pre -> next;
            pre -> next = move;
        }
        return new_head -> next;
    }

拙作留念

ListNode* reverseBetween(ListNode* head, int m, int n) {
        ListNode *cur,*pre_head,*next_end, *pre,*nxt;
        if(m==n) return head;
        
        pre_head = NULL;
        cur = head;
        // m<= n
        for(int i=1;i<=n;i++){
            if(i<m){
                pre_head=cur;
            }
            cur = cur->next;
        }
        next_end = cur;
        
        if(pre_head==NULL){
            pre=head;
        }else{
            pre=pre_head->next;
        }
        
        cur=next_end;
        while(pre->next!=next_end){
            nxt=pre->next;
            
            pre->next = cur;
            cur=pre;
            pre=nxt;
        }
        
        pre->next=cur;
        if(pre_head)
            pre_head->next = pre;
        else
            head=pre;   
        return head;
    }