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
LeetCode类似题目：
http://blog.csdn.net/github_27609763/article/details/49202323

分析：如何将给定的链表每隔K个节点进行反转，如果不满足K个节点则不进行反转操作，最后返回变化后的链表。
具体算法演示如图示：

红色表示第一次循环，绿色表示第二次循环，节点（指针)p,c用于实现两节点对换，n始终指向k-1th（相对位置） 节点，t记录n的下一个位置。
java代码：Accepted

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode reverseKGroup(ListNode head, int k) {
       // Start typing your Java solution below
        // DO NOT write main() function
        if(k<=1 || head==null || head.next==null) return head;

        ListNode prev = new ListNode(0);
        prev.next = head;
        head = prev;
        ListNode cur=prev.next;
        while(cur!=null){
            int counter = k;
            while(cur!=null && counter>1){
                cur = cur.next;
                counter--;
            }

            if(cur!=null){
                cur=prev.next;
                counter=k;
                while(counter>1){
                    ListNode temp = cur.next;
                    cur.next=temp.next;
                    temp.next=prev.next;
                    prev.next=temp;
                    counter--;
                }
                prev = cur;
                cur = prev.next;
            }
        }

        return head.next;
    }
}

如何实现链表反转参考文献：
http://www.geeksforgeeks.org/reverse-a-list-in-groups-of-given-size/
http://www.geeksforgeeks.org/write-a-function-to-reverse-the-nodes-of-a-linked-list/
http://www.cnblogs.com/lichen782/p/leetcode_Reverse_Nodes_in_kGroup.html