[leetcode-92]Reverse Linked List II(c++)

问题描述：
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.

分析：这道题主要来考察链表的操作。建议最好画个图，另外，在对某节点操作时，一定要注意到是否为NULL。

代码如下：4ms

/**
 * 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) {
        int index = 1;
        ListNode *cur = head;
        struct ListNode *tmpPrev = NULL;
        if(m==n)
            return head;

        while(cur){
            if(index==m)
                break;
            tmpPrev = cur;
            cur = cur->next;
            index++;
        }
        struct ListNode *tmpCur = cur;

        struct ListNode *next;
        struct ListNode *prev = NULL;
        for(int i = index;i<=n;i++){
            next = cur->next;
            cur->next = prev;
            prev = cur;
            cur = next;
        }
        if(tmpPrev)
            tmpPrev->next = prev;
        else
            head = prev;

        tmpCur->next = cur;

        return head;
    }
};