Problem0025

README

25. 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.

k is a positive integer and is less than or equal to the length of the linked 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个节点进行逆转，不足k个的末尾，则不需要逆转。

详见注释

总结

Documentation

Index

• type ListNode

Types

type ListNode

type ListNode struct {
	Val  int
	Next *ListNode
}

ListNode 是链接节点