[LeetCode]Reverse Nodes in k-Group

题目描述

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

将链表按每节长度为k的子链表逆转。

解题思路

基本思路就是；

1 逆转长度为k的子链表，并得到下次逆转的子链表头；

2 将上次逆转的子链表尾指向本次逆转的子链表头；

3 重复上述步骤k次；

代码

逆转子链表可以单写成一个函数，我这里没有优化。

public ListNode reverseKGroup(ListNode head, int k) {
		ListNode node = head;
		if (k == 0 || k == 1) {
			return node;
		}

		int length = 0;
		while (node != null) {
			node = node.next;
			length++;
		}

		if (k > length) {
			return node = head;
		} else {
			int parts = length / k;
			ListNode tempHead = head;
			ListNode tempTail = head;
			ListNode tempNode = head;
			ListNode lastTailNode = head;
			//循环length/k次
			for (int i = 0; i < parts; i++){
				//逆转第i个长度为k的子链表
				for (int j = 0; j < k - 1; j++) {
					tempNode = tempTail.next;
					tempTail.next = tempNode.next;
					tempNode.next = tempHead;
					tempHead = tempNode;
				}
				if(i==0){
					//第一次逆转玩的链表头为最后的head
					node = tempHead;
				} else {
					//剩余的length/k-1次需要将上次的子链表尾指向当前的链表头
				   lastTailNode.next = tempHead;
				}
				//为下一次逆转做准备
				tempHead = tempTail.next;
				lastTailNode = tempTail;
				tempTail = tempHead;
			}
			
		}
		return node;
	}