-
Notifications
You must be signed in to change notification settings - Fork 0
/
linkedlist.go
166 lines (138 loc) · 2.75 KB
/
linkedlist.go
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
package main
import "fmt"
type Node struct {
value int
next *Node
}
type LinkedList struct {
head *Node
length int
}
// Add value to beginning of the list
func (linkedList *LinkedList) prepend(value int) {
newNode := Node{}
newNode.value = value
if linkedList.head == nil {
newNode.next = nil
} else {
newNode.next = linkedList.head
}
newNode.next = linkedList.head
linkedList.head = &newNode
linkedList.length++
return
}
// Add a value to end of the list
func (linkedList *LinkedList) append(value int) {
newNode := Node{}
newNode.value = value
newNode.next = nil
if linkedList.head == nil {
linkedList.head = &newNode
linkedList.length++
return
}
ptr := linkedList.head
for ptr.next != nil {
ptr = ptr.next
}
ptr.next = &newNode
linkedList.length++
}
// Add value to specified index of Linked list
func (linkedList *LinkedList) insert(position, value int) {
if position <= 0 {
fmt.Println("Error: Invalid position")
return
}
newNode := Node{}
newNode.value = value
if position >= linkedList.length {
linkedList.append(value)
return
}
if position == 1 {
linkedList.prepend(value)
return
}
ptr := linkedList.head
for i := 0; i != position-1; {
ptr = ptr.next
i++
}
newNode.next = ptr.next
ptr.next = &newNode
linkedList.length++
}
// Remove a value from the list
func (linkedList *LinkedList) remove(position int) {
if position > linkedList.length || position < 0 {
fmt.Println("Error: Invalid position")
return
}
if position == 0 {
linkedList.removeFromBeginning()
return
}
if position == linkedList.length {
linkedList.removeFromEnd()
return
}
ptr := linkedList.head
for i := 0; i <= position-2; i++ {
if i == position-2 {
ptr.next = ptr.next.next
linkedList.length--
return
}
ptr = ptr.next
}
}
// Remove value from beginning
func (linkedList *LinkedList) removeFromBeginning() {
if linkedList.length == 0 {
fmt.Println("Error: Linked List is empty")
return
}
linkedList.head = linkedList.head.next
linkedList.length--
return
}
// Remove value from end
func (linkedList *LinkedList) removeFromEnd() {
if linkedList.length == 0 {
fmt.Println("Error: Linked List is empty")
return
}
ptr := linkedList.head
for ptr.next.next != nil {
ptr = ptr.next
}
ptr.next = nil
linkedList.length--
}
func (linkedList *LinkedList) display() {
if linkedList.head == nil {
fmt.Println("Linked list is empty")
return
}
ptr := linkedList.head
for ptr.next != nil {
fmt.Print(ptr.value, " ")
ptr = ptr.next
}
fmt.Print(ptr.value)
fmt.Printf("\nLength: %d\n", linkedList.length)
}
func main() {
l := LinkedList{}
l.append(10)
l.prepend(4)
l.insert(1, 12)
l.insert(43, 31)
l.append(21)
l.remove(4)
l.removeFromBeginning()
l.removeFromEnd()
l.display()
}