【LeetCode 25】K 个一组翻转链表

思路

 若子链表的长度超过k，则对该子链表进行反转。联系LeetCode 206题即可以解答。

	public static ListNode reverseKGroup(ListNode head, int k) {
		if (k <= 1)
			return head;
		
		ListNode dummy = new ListNode();
		dummy.next = head;
		ListNode preNode = dummy;
		ListNode p = head;

		while (p != null)
		{
			ListNode rem = p;
			int n = k;
			while (p.next != null && n > 1)
			{
				p = p.next;
				n--;
			}
			if (n == 1)
			{
				ListNode pnext = p.next;
				p.next = null; // 反转子链表时，子链表最后一个节点应该是null
				ListNode newHead = reverseList(rem);
				preNode.next = newHead;  // 子链表反转后的头节点
				ListNode newEnd = rem; // 子链表反转后的尾节点
				newEnd.next = pnext;
				preNode = rem;
				p = pnext;
			}
			else // 已经是最后一个节点了 
				break;
		}
		return dummy.next;
    }
	
	// 新的头节点为preNode，新的尾节点为head
    private static ListNode reverseList(ListNode head) {
    	if (head == null)
    		return null;
    	ListNode dummy = new ListNode();
    	dummy.next = head;
    	ListNode preNode = dummy;
    	ListNode p = head;
    	while (p != null)
    	{
    		ListNode rem = p.next;
    		p.next = preNode;
    		preNode = p;
    		p = rem;
    	}
    	head.next = null;
    	return preNode;
    }