【Leetcode】Reverse Nodes in k-Group (Swap)

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.

If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.

You may not alter the values in the nodes, only nodes itself may be changed.

Only constant memory is allowed.

For example,

Given this linked list: 1->2->3->4->5

For k = 2, you should return: 2->1->4->3->5

For k = 3, you should return: 3->2->1->4->5

这道题关键是要找到需要reverse的链表节点群

所以首先构造helper

如果是0-1-2-3-4-5-6-7-8

k=3的话，就是要把0-1-2-3-4逆置成0-3-2-1-4 其中0是start，4是end。

逆置的步骤如下

寻找newHead: newHead=start.next;

寻找插入元素insert: ListNode insert = newHead.next;

记录next元素: ListNode next = insert.next;

把insert插入到start之后:insert.next=start.next; start.next=insert;

选定下一个插入元素: insert=next;

等到全部元素插入完之后，连接newHead和end: newHead.next=end; 

	public ListNode reverse(ListNode start, ListNode end) {
		if (start == null || start.next == null)
			return start;
		ListNode newHead = start.next;
		ListNode insert = newHead.next;
		while (insert != end) {
			ListNode next = insert.next;
			insert.next = start.next;
			start.next = insert;
			insert = next;
		}
		newHead.next = end;
		return newHead;
	}

如何找start and end? 用一个计数器就OK,找到了count就清0，

        while(cur!=null) {
            ListNode next = cur.next;
            if(count==k) {
                pre=reverse(pre, next);
                cur=next;
                count=1;
            }
            else {
                cur=cur.next;
                count++;
            }
        }

最后给出完整代码

	public ListNode reverseKGroup(ListNode head, int k) {
		if (head == null)
			return head;
		ListNode helper = new ListNode(0);
		helper.next = head;
		ListNode pre = helper;
		ListNode cur = head;
		int count = 1;

		while (cur != null) {
			ListNode next = cur.next;
			if (count == k) {
				pre = reverse(pre, next);
				cur = next;
				count = 1;
			} else {
				cur = cur.next;
				count++;
			}
		}
		return helper.next;
	}

	public ListNode reverse(ListNode start, ListNode end) {
		if (start == null || start.next == null)
			return start;
		ListNode newHead = start.next;
		ListNode insert = newHead.next;
		while (insert != end) {
			ListNode next = insert.next;
			insert.next = start.next;
			start.next = insert;
			insert = next;
		}
		newHead.next = end;
		return newHead;
	}