LeetCode T25 Reverse Nodes in k-Group

题目地址：

中文：https://leetcode-cn.com/problems/reverse-nodes-in-k-group/
英文：https://leetcode.com/problems/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.

k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes, in the end, should remain as it is.

Follow up:

• Could you solve the problem in O(1) extra memory space?
• You may not alter the values in the list’s nodes, only nodes itself
  may be changed.

Example 1:

Input: head = [1,2,3,4,5], k = 2
Output: [2,1,4,3,5]

Example 2:

Input: head = [1,2,3,4,5], k = 3
Output: [3,2,1,4,5]

Example 3:

Input: head = [1,2,3,4,5], k = 1
Output: [1,2,3,4,5]

Example 4:

Input: head = [1], k = 1
Output: [1]

Constraints:

• The number of nodes in the list is in the range sz.
• 1 <= sz <= 5000
• 0 <= Node.val <= 1000
• 1 <= k <= sz

思路：

这题很麻烦，因为要改链表指向，还涉及一些细节问题，比如头尾结点的处理。

题解：

/**
 * 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) {
        if(k==1) return head;
        int i;
        ListNode res = new ListNode(0);
        res.next = head;

        ListNode pre = null;
        ListNode pre_ = res;
        ListNode now;
        ListNode nxt;
        ListNode temp = res;
        while(temp.next!=null){
            i=k;
            while(i--!=0){
                if(temp==null) return res.next;
                temp = temp.next;
            }
            if(temp==null) break;
            nxt = temp.next;
            temp.next = null;

            now = pre_.next;
            ListNode swap_;
            ListNode first = now;
            while (now!=null){
                swap_ = now.next;
                now.next = pre;
                pre = now;
                now = swap_;
            }
            pre_.next=pre;
            first.next = nxt;
            pre_ = first;
            temp = pre_;
        }
        return res.next;
    }
}