reverse_linked_list_test.go

/*
Problem:
- Reverse a linked list in-place.

Approach:
- Iterate through the list and point each node's next pointer to the previous
  item.

Cost:
- O(n) time and O(1) space.
*/

package interviewcake

import (
	"testing"

	"github.com/hoanhan101/algo/common"
)

func TestReverseLinkedList(t *testing.T) {
	// define tests input.
	t0 := common.NewListNode(0)

	t1 := common.NewListNode(1)

	t2 := common.NewListNode(1)
	t2.AddNext(2)

	t3 := common.NewListNode(1)
	t3.AddNext(2)
	t3.AddNext(3)

	// define tests output.
	tests := []struct {
		in       *common.ListNode
		expected []int
	}{
		{t0, []int{0}},
		{t1, []int{1}},
		{t2, []int{2, 1}},
		{t3, []int{3, 2, 1}},
	}

	for _, tt := range tests {
		node := reverseLinkedList(tt.in)
		common.Equal(t, tt.expected, common.LinkedListToSlice(node))
	}
}

func reverseLinkedList(node *common.ListNode) *common.ListNode {
	current := node
	var previous, next *common.ListNode

	for current != nil {
		// copy a pointer to the next element.
		next = current.Next

		// reverse the next pointer.
		current.Next = previous

		// step forward in the list.
		previous = current
		current = next
	}

	// return the head of new linked list.
	return previous
}