【leetcode 链表相关】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的整数个，剩下的节点不进行颠倒。该题的解法可以分层三个步骤：（1）首先用一个temp节点判断剩下的节点个数够不够k个，不够k个则剩下的节点不用颠倒直接输出结果，如果够k个进入下一步；（2）将k个节点颠倒，因为题目中要求只能使用常数空间，所以不用Stack结构，直接用三个节点：pPre、pCur、pNext来改变节点的链接关系；（3）将新颠倒的k个节点加入已完成的链表中，重复第一步。

Java AC代码：

public class ReverseNodes {
	public ListNode reverseKGroup(ListNode head, int k) {
		if(head==null || k==1){
			return head;
		}
		ListNode pPause = new ListNode(0);
		ListNode pPre = null;
		ListNode pCur = head;
		ListNode pNext = null;
		pPause.next = head;
		head = pPause;
		
		while(pCur!=null){
			ListNode pTemp = pCur;
			int i = k;
			while(--i>0 && pTemp!=null){
				pTemp = pTemp.next;
			}
			if(pTemp==null){
				return head.next;
			}
			
			i = k;
			while(i-->0){
				pNext = pCur.next;
				pCur.next = pPre;
				pPre = pCur;
				pCur = pNext;
			}
			ListNode t = pPause.next;
			t.next = pCur;
			pPause.next = pPre;
			pPause = t;
		}
		
		return head.next;
	}
}