92. Reverse Linked List II

---

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

Note: 1 ≤ m ≤ n ≤ length of list.

Example:

Input: 1->2->3->4->5->NULL, m = 2, n = 4
Output: 1->4->3->2->5->NULL

参照Reverse Linked List I的做法 ， 直接调用已有的函数

 class Solution {

 public:
	 ListNode* reverseList(ListNode * head, int n) {
		 ListNode* prev = NULL;
		 ListNode* cur = head;
		 ListNode *next = NULL;
		 int j = 0;
		 while (j < n){
			 next = cur->next;
			 cur->next = prev;
			 prev = cur;
			 cur = next;
			 ++j;
		 }
		 head->next = next; // head 现在变成了尾部， 尾部再接上剩下的部分

		 return prev;
	 }

	 ListNode* reverseBetween(ListNode* head, int m, int n) {
		 ListNode *beforBegin;
		 ListNode * p = head;
		 int i = 1;
		 beforBegin = NULL;
		 
		 if (m == 1)  p = head;
		 else
		 {
			 while (i < m)
			 {
				 i++;
				 beforBegin = p;
				 p = p->next;
			 }
		 }
		 if (beforBegin != NULL){
			 beforBegin->next = reverseList(p, n - m + 1);  //如果在翻转部分接到之前的后面
			 return head;    
		 }  
		 else
		   {
			 return reverseList(p, n - m + 1);  //从头开始翻转的话
		 }
	 }
 };