看注释,思路简单,实现容易,在leetcode中耗时0秒,击败100% import java.util.*; public class Solution { public ListNode reverseKGroup (ListNode head, int k) { int count = 0; ListNode p = head; while(p!=null){ ++count; p=p.next; if(count>=k) break; //每次只需...