Leetcode92. 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

替换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) {
		if (head == NULL) {
			return NULL;
		}
		ListNode* dummy = new ListNode(-1);
		dummy->next = head;
		int index = 0;
		ListNode* ret = dummy;
		while (index<m-1)
		{
			ret = ret->next;
			index++;
		}
		ListNode* first = ret->next;
		ListNode* target = ret->next->next;
		ListNode* temp = NULL;
		while (index<n-1) {
			temp = ret->next;
			ret->next = target;
			first->next=target->next;
			target->next = temp;
			target = first->next;
			index++;
		}
		return dummy->next;
	}
};