Lintcode 450 · Reverse Nodes in k-Group go

/**
450 · Reverse Nodes in k-Group
Algorithms
Hard
Accepted Rate
40%

DescriptionSolutionNotesDiscussLeaderboard
Description
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.

Example
Example 1

Input:
list = 1->2->3->4->5->null
k = 2
Output:
2->1->4->3->5
Example 2

Input:
list = 1->2->3->4->5->null
k = 3
Output:
3->2->1->4->5
Tags
Company
Facebook
Microsoft

https://blog.csdn.net/qq_46105170/article/details/105578074

https://www.lintcode.com/problem/450/
*/

type ListNode struct {
	Val  int
	Next *ListNode
}


/**
 * @param head: a ListNode
 * @param k: An integer
 * @return: a ListNode
 */
func reverseKGroup(head *ListNode, k int) *ListNode {
	// write your code here
	var dummy ListNode = ListNode{0, nil}
	dummy.Next = head
	var prev *ListNode = &dummy
	for {
		prev = reverseK(prev, k)
		if prev == nil {
			break
		}

	}
	return dummy.Next
}

func reverseK(prev *ListNode, k int) *ListNode {
	var nk *ListNode = prev
	for i := 0; i < k; i++ {
		nk = nk.Next
		if nk == nil {
			return nil
		}
	}
	var tail *ListNode = nk.Next
	nk.Next = nil
	var n1 *ListNode = prev.Next
	prev.Next = reverse(prev.Next)
	n1.Next = tail
	return n1
}

func reverse(head *ListNode) *ListNode {
	var prev *ListNode = nil
	for {
		if head == nil {
			break
		}
		var tmp *ListNode = head.Next
		head.Next = prev
		prev = head
		head = tmp
	}
	return prev
}