LeetCode-Reverse Linked List II

Reverse a linked list from position m to n. Do it in-place and in one-pass.

For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,

return 1->4->3->2->5->NULL.

Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.

Solution:

Code:

<span style="font-size:14px;">/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *reverseBetween(ListNode *head, int m, int n) {
        if (m == n) return head;
        if (m == 1) {
            ListNode *begin = head, *end = head, *headNext; 
            head = head->next;
            for (int i = 0; i < n-m; i++) {
                headNext = head->next;
                head->next = begin;
                begin = head;
                head = headNext;
            }
            end->next = head;
            return begin;
        } else {
            ListNode *begin, *end, *left, *temp = head, *tempNext;
            for (int i = 2; i < m; i++)
                temp = temp->next;
            left = temp;
            temp = temp->next;
            begin = temp;
            end = temp;
            temp = temp->next;
            for (int i = 0; i < n-m; i++) {
                tempNext = temp->next;
                temp->next = begin;
                begin = temp;
                temp = tempNext;
            }
            left->next = begin;
            end->next = temp;
            return head;
        }
    }
};</span>