反转链表 II

反转链表 II
反转从位置 m 到 n 的链表。请使用一趟扫描完成反转。

说明:
1 ≤ m ≤ n ≤ 链表长度。
示例:
输入: 1->2->3->4->5->NULL, m = 2, n = 4
输出: 1->4->3->2->5->NULL
解答：关键在于设置一个before与after节点，其次，注意使用四步翻转链表法：ListNode* temp = curr->next; curr->next = prev; prev = curr; curr = temp;

整体代码如下：`class Solution {
public:
ListNode* reverseBetween(ListNode* head, int m, int n) {
if(n==1||!head) return head;
ListNode *prev = NULL, *curr = head;
while(m>1){
prev = curr;
curr = curr->next;
m–;
n–;
}
ListNode *before = prev, after = curr;
while(n){
ListNode temp = curr->next;
curr->next = prev;
prev = curr;
curr = temp;
n–;
}
if(before)
before->next = prev;
else
head = prev;
after->next = curr;
return head;

}

};`