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

将从m~n的链表反转。用stack很方便实现，没啥好说的。

代码写的略难看……

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 || !head->next)
			return head;
		int count(1);
		ListNode *l1(NULL), *l2(NULL);
		ListNode *h(head);
		bool flag(false);
		stack<ListNode*> list;
		while (head)
		{
			if (count == m - 1)
				l1 = head;
			if (count == n + 1)
				l2 = head;
			if (count == m)
				flag = true;
			if (flag)
				list.push(head);
			if (count == n)
				flag = false;
			if (l2)
				break;
			head = head->next;
			count++;
		}
		if (l1)
			l1->next = list.top();
		else
			h = list.top();
		while (!list.empty())
		{
			ListNode *temp = list.top();
			list.pop();
			if (list.empty())
			{
				if (l2)
					temp->next = l2;
				else
					temp->next = NULL;
			}
			else
				temp->next = list.top();
		}
		return h;
	}
};