leetcode Reverse Nodes in k-Grou

题目

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

解题思路：

用一个指针p遍历链表，另一个指针q指向p的下一个节点，然后用q往后遍历，并用cnt计数，如果后面有p后面没有k个元素则推出循环，如果p后面有k个元素，就用q将p后面的k-1节点取出来，放到p的前面，当插入第一个k-1个节点时，将q放到head之前就行，可以用head来操作，之后的话，就必须用一个prev节点来定位q要插入的位置，开始prev指向p的前面的指针，q就插入到p的前面，prev的后面，之后，q就插入到prev的后面。

代码：

public ListNode reverseKGroup(ListNode head, int k) {  
        if (head == null)  
            return null;  
        if (k == 1)  
            return head;  
        ListNode last = new ListNode(0);  
        last.next = head;  
        head=last;  
        while (last.next != null) {  
            ListNode p1 = last.next;  
            int count = 1;  
            while (count < k && p1.next != null) {  
                p1 = p1.next;  
                count++;  
            }  
            if (count == k) {  
                p1 = last.next;  
                ListNode p0 = p1;  
                ListNode p2 = p1.next;  
                while (count-- > 1) {  
                    ListNode tmp = p2.next;  
                    p2.next = p1;  
                    p1 = p2;  
                    p2 = tmp;  
                }  
                last.next = p1;  
                p0.next = p2;  
                last = p0;  
            } else {  
                break;  
            }  
        }  
        return head.next;  
    }  

参考链接：

http://www.shangxueba.com/jingyan/1819445.html
http://blog.csdn.net/tingmei/article/details/8050556