BM2 链表内指定区间反转

/**
 * struct ListNode {
 *  int val;
 *  struct ListNode *next;
 *  ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
class Solution {
  public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param head ListNode类
     * @param m int整型
     * @param n int整型
     * @return ListNode类
     */
    ListNode* reverseBetween(ListNode* head, int m, int n) {
        auto* pre = new ListNode(-1);
        ListNode* p, *q, *end, *start;
        p = head;
        for (int i = 0; i < m-1 ; i++) {
            start = p;
            p = p->next;
        }
        end = p;
        for(int i=0; i< n-m+1; i++){
            q = p->next;
            p->next=pre->next;
            pre->next=p;
            p=q;
        }
        end->next = p;
        if(m==1) return pre->next;
        start->next = pre->next;
        return head;
    }
};