本文共 560 字，大约阅读时间需要 1 分钟。

解题思路

public class Solution {       public static ListNode reverseKGroup(ListNode head, int k) {   		if(head == null || head.next == null || k < 2) return head;		ListNode dummy = new ListNode(0);		dummy.next = head;		ListNode pre = dummy, cur = head, temp;		int len = 0;		while (head != null) {   			len ++ ;			head = head.next;		}		for (int i = 0; i < len / k; i ++ ) {   			for (int j = 1; j < k; j ++ ) {   				temp = cur.next;				cur.next = temp.next;				temp.next = pre.next;				pre.next = temp;			}			pre = cur;			cur = cur.next;		}		return dummy.next;	}}

转载地址：http://gser.baihongyu.com/