25. K 个一组翻转链表

25. K 个一组翻转链表

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode reverseKGroup(ListNode head, int k) {
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        ListNode pre = dummy;
        while(head != null){
            ListNode tail = pre;
            for(int i = 0; i < k;i++){
                tail = tail.next;
                if(tail == null)return dummy.next;
            }
            ListNode nex = tail.next;
            ListNode[] re = reverse(head,tail);
            head = re[0];
            tail = re[1];

            pre.next = head;
            tail.next = nex;

            pre = tail;
            head = tail.next;
        }
        return dummy.next;
    }
    public ListNode[] reverse(ListNode head,ListNode tail){
        ListNode prev = tail.next;
        ListNode p = head;
        while(prev != tail){
            ListNode nex = p.next;
            p.next = prev;
            prev = p;
            p = nex;
        }
        
        return new ListNode[]{tail,head};
    }
    
}