-
Notifications
You must be signed in to change notification settings - Fork 1
/
linkedList.go
95 lines (67 loc) · 1.25 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
package main
import "fmt"
func main (){
var l = LinkedList{}
var p Person= Person{"ddd",3}
l.insert(&p)
l.insert(&Person{"John", 19})
l.insert(&Person{"John", 19})
l.insert(&Person{"John", 19})
l.insert(&Person{"John", 19})
l.remove()
l.display()
}
type Person struct {
name string
age int
}
var p = Person{"",3}
type Node struct {
data *Person
next *Node
}
type LinkedList struct {
head *Node
current *Node
}
func (l *LinkedList) isEmpty() bool{
return l.head == nil
}
func (l *LinkedList) findNext(){
l.current = l.current.next
}
func (l *LinkedList) insert(val *Person){
if l.head == nil {
l.current = &Node{val,nil}
l.head = l.current
} else {
tmp:= l.current.next
n:= Node{val, tmp}
l.current.next = &n
l.current = l.current.next
}
}
func (l *LinkedList) remove() {
if l.current == l.head {
l.head = l.head.next
}else {
temp:= l.head
for temp.next != l.current {
temp = temp.next
}
temp.next = l.current.next
}
if l.current.next == nil { // single node list
l.current = l.head
}else{
l.current = l.current.next
}
}
func (l *LinkedList) display(){
p:= l.head
for p != nil {
fmt.Printf(" %v -> ", p.data)
p = p.next
}
fmt.Println()
}