leetcode Reverse Linked List II

题目链接

这个题目看上去很简单。但是其实考虑的问题有很多。。最特殊情况。如果从第一个就开始反转，那么链表头结点要改

一个简单的方法就是增加一个头结点。这样省着改头结点

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode reverseBetween(ListNode head, int m, int n) {
        if(head==null||head.next==null)
        {
            return head;
        }
        ListNode front=head;
        for(int i=1;i<m-1;i++)
        {
            front=front.next;
        }

        ListNode current=null;
        ListNode nextNode=null;

        ListNode workHead=null;
        ListNode workTail=null;

        if(m!=1)
        {
            current=front.next;
            nextNode=current.next;
            current.next=null;
            workHead=current;
            workTail=current;
        }
        else
        {
            current=head;
            nextNode=head.next;
            head.next=null;
            workHead=head;
            workTail=head;
        }

        for(int i=1;i<n-m+1;i++)
        {
            current=nextNode;
            nextNode=current.next;
            current.next=workHead;
            workHead=current;
        }
        workTail.next=nextNode;
        if(m!=1)
        {
        front.next=workHead;
        }
        if(m==1)
        {
            return workHead;
        }
        return head;

    }
}

大神做法

ListNode* reverseBetween(ListNode *head, int m, int n) {
    ListNode dummy(0), *prev = &dummy;
    dummy.next = head;
    for (int i=1; i<m; i++)
        prev = prev->next;
    ListNode *pivot = prev->next;
    for (int i=m; i<n; i++) {
        swap(prev->next, pivot->next->next);
        swap(prev->next, pivot->next);
    }
    return dummy.next;
}