Reverse Linked List

reverse.go

//@ympons
// Reverse Linked List
package main

import "fmt"

type Node struct {
	value int
	next *Node
}

type List struct {
	head *Node
}

func (l *List) Add(v int) {
	n := &Node{v, nil}
	t := l.head
	if (t == nil) {
		l.head = n
		return
	}
	for t.next != nil {
		t = t.next
	}
	t.next = n
}

func (l *List) Reverse() {
	var prev *Node
	current := l.head
	var next *Node
	for current != nil {
		next = current.next
		current.next = prev
		prev = current
		current = next
	}
	l.head = prev		
}

func (l *List) Print() {
	t := l.head
	for t != nil {
		fmt.Println(t.value)
		t = t.next		
	}
}

func main() {
	l := List{}
	l.Add(1)
	l.Add(2)
	l.Add(3)
	l.Print()
	fmt.Println("Reversed")
	l.Reverse()
	l.Print()
}