[LeetCode] Reverse Nodes in k-Group

原题链接

一题一句：

经典题目，在reverse 方程中，重点理解  prev-> (head->cur----------)->end的关系，注意此处end不在k个node中。

/**
 * 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) {
        if(head == null){
            return head;
        }
        int count = 0;
        ListNode guard = new ListNode(0);
        guard.next = head;
        ListNode prev = guard;
        ListNode cur = head;
        while(cur != null){
            count ++;
            ListNode next = cur.next;
            if(count == k){

                prev = reverse(prev,next);
                count = 0;
            }
            cur = next;
        }
        return guard.next;
        
    }
    public ListNode reverse(ListNode prev,ListNode end){
        if(prev == null || prev.next == null){
            return prev;
        }
        ListNode head = prev.next;
        ListNode cur = head.next;
        while(cur != end){
            ListNode next = cur.next;
            cur.next = prev.next;
            prev.next = cur;
            cur = next;
        }
        head.next = end;
        return head;
    }    
}
//other way 
public class Solution {
    public ListNode reverseKGroup(ListNode head, int k) {
        if(head == null || k==1)
            return head;
        ListNode node = head;
        int count = 0;
        while(node != null){
            node = node.next;
            count ++;
        }
        if(count < k)
            return head;
        int times = count/k;
        ListNode guard = new ListNode(0);
        guard.next =head;
        ListNode prev = guard;
        ListNode cur = head;
        ListNode nxt = head.next;
        
        for(int i=1; i<=times; i++){
            
            for(int j=1 ; j<=k-1; j++){
                ListNode temp = nxt.next;
                nxt.next = cur;
                cur = nxt;
                nxt = temp;
            }
            ListNode temp2 = prev.next;
            prev.next.next = nxt;
            prev.next = cur;
            
            if(i == times)//if(cur == null)
                break;
            prev = temp2;
            cur = temp2.next;
            nxt = cur.next;

        }
        return guard.next;
    }
}