Go/data_structures/linkedlist/singly_linkedlist/singly_linkedlist2.go at f37786a95af51365f010af5a4beb28a26fb7d839 · TheAlgorithms/Go · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
package singly_linkedlist

// TODO not needed because there is already an implementation of SingleLinkedList

// import "fmt"

// /* v is the value of node; next is the pointer to next node */
// type node struct {
// 	v    int
// 	next *node
// }

// /* first node, called head. It points from first node to last node */
// var head *node = nil

// func (l *node) pushFront(val int) *node {
// 	/* if there's no nodes, head points to l (first node) */
// 	if head == nil {
// 		l.v = val
// 		l.next = nil
// 		head = l
// 		return l
// 	} else {
// 		/* create a new node equals to head */
// 		nnode := new(node)
// 		nnode = head
// 		/* create a second node with new value and `next -> nnode`
// 		*  is this way, nnode2 is before nnode
// 		 */
// 		nnode2 := &node{
// 			v:    val,
// 			next: nnode,
// 		}
// 		/* now head is equals nnode2 */
// 		head = nnode2
// 		return head
// 	}
// }

// func (l *node) pushBack(val int) *node {
// 	/* if there's no nodes, head points to l (first node) */
// 	if head == nil {
// 		l.v = val
// 		l.next = nil
// 		head = l
// 		return l
// 	} else {
// 		/* read all list to last node */
// 		for l.next != nil {
// 			l = l.next
// 		}
// 		/* allocate a new portion of memory */
// 		l.next = new(node)
// 		l.next.v = val
// 		l.next.next = nil
// 		return l
// 	}
// }

// func (l *node) popFront() *node {
// 	if head == nil {
// 		return head
// 	}
// 	/* create a new node equals to first node pointed by head */
// 	cpnode := new(node)
// 	cpnode = head.next

// 	/* now head is equals cpnode (second node) */
// 	head = cpnode

// 	return head
// }

// func (l *node) popBack() *node {
// 	if head == nil {
// 		return head
// 	}
// 	/* create a new node equals to head */
// 	cpnode := new(node)
// 	cpnode = head

// 	/* read list to the penultimate node */
// 	for cpnode.next.next != nil {
// 		cpnode = cpnode.next
// 	}
// 	/* the penultimate node points to null. In this way the last node is deleted */
// 	cpnode.next = nil
// 	return head
// }

// func main() {
// 	lista := new(node)
// 	lista.pushBack(25).pushBack(24).pushBack(32) /* lista: 25 24 32 */
// 	lista.pushBack(56)                           /* lista: 25 24 32 56 */
// 	lista.pushFront(36)                          /* lista: 36 25 24 32 56 */
// 	lista.popFront()                             /* lista: 25 24 32 56 */
// 	lista.popBack()                              /* lista: 25 24 32 */

// 	/* read the list until head is not nil */
// 	for head != nil {
// 		fmt.Printf("%d ", head.v)
// 		head = head.next /*head points to next node */
// 	}
// }