leetcode 刷题之路 11 Reverse Nodes in k-Group

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.

If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.

You may not alter the values in the nodes, only nodes itself may be changed.

Only constant memory is allowed.

For example,
Given this linked list: 1->2->3->4->5

For k = 2, you should return: 2->1->4->3->5

For k = 3, you should return: 3->2->1->4->5

以k个节点为单位进行链表逆序，如果链表节点个数不足k个，则不进行逆序，需要注意的是这道题目输入的链表是没有头结点的，因此为了方便操作，需要先建立一个头结点dummyHead。具体解题思路为，首先定义函数reverseListNode，这个函数输入为head,tail，分别指向一个链表头结点和尾节点，函数将head和tail之间的所有节点进行逆序（不包括head和tail)。有了这个函数，我们只需要对于输入的链表进行遍历计数，依次找出每k个链表节点并利用reverseListNode函数对这k个节点进行逆序即可，注意调用reverseListNode函数时的输入分别为这k个链表节点第一个节点的前一个节点和最后一个节点的后一个节点。

my accepted answer:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
ListNode* reverseListNode(ListNode* head, ListNode* tail)
 {
	 if (head == NULL || head->next == NULL)
		 return head;
	 
	 ListNode *pPre, *pCur;
	 pPre = head->next;
	 pCur = pPre->next;
	 while (pCur != tail)
	 {
		 pPre->next = pCur->next;
		 pCur->next = head->next;
		 head->next = pCur;
		 pCur = pPre->next;
	 }
	 return pPre;
 }
class Solution
{
public:
	ListNode *reverseKGroup(ListNode *head, int k)
	{
		if (head == NULL || k == 1)
			return head;
		ListNode* dummyHead = new ListNode(0);
		dummyHead->next = head;
		ListNode* tempDummyHead = dummyHead;
		int i = 0;
		while (head != NULL)
		{
			i++;
			if (i%k == 0)
			{
				tempDummyHead = reverseListNode(tempDummyHead, head->next);
				head=tempDummyHead->next;
			}
			else
				head = head->next;
		}
		ListNode *ret=dummyHead->next;
		delete dummyHead;
		return ret;
	}
};