递归解决 import java.util.*; /* * public class ListNode { * int val; * ListNode next = null; * } */ public class Solution { /** * 递归解决,每k个一组 * 函数定义:将head为头结点的链表,按照k个一组反转, *...