题解 | #链表内指定区间反转#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */

class Solution {
public:
    /**
     * 
     * @param head ListNode类 
     * @param m int整型 
     * @param n int整型 
     * @return ListNode类
     */
    ListNode* reverseBetween(ListNode* head, int m, int n) {
        // write code here
        if(head==NULL){return NULL;}
        int result=0;
        ListNode*d=new ListNode(-1);
        //ListNode*d;
        d->next=head;
        ListNode*pre=d;
        ListNode*cur=head;
        while(cur!=NULL){
            result++;
            if(result>=m&&result<n){
                ListNode*temp=cur->next;
                cur->next=temp->next;
                temp->next=pre->next;
                pre->next=temp;  
                continue;
            }
            if(result==n-1){break;}
            pre=cur;
            cur=cur->next;
            
        }
        return d->next;
    }
};