-
Notifications
You must be signed in to change notification settings - Fork 4
/
linkedlist.go
83 lines (74 loc) · 1.24 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
package kv_store
import "fmt"
type Node struct {
Next *Node
Key string
Data string
}
type Linkedlist struct {
Head *Node
Size int
}
//Creates a new instance of linkedlist
func newLinkedList() *Linkedlist {
return &Linkedlist{
Head: nil,
Size: 0,
}
}
//Check if list is empty
func (ll *Linkedlist) isEmpty() bool {
if ll.Head == nil {
return true
}
return false
}
//Adds a new pair to linkedlist
func (ll *Linkedlist) add(strA, strB string) {
newNode := &Node{
Next: nil,
Key: strA,
Data: strB,
}
if ll.Head != nil {
newNode.Next = ll.Head
}
ll.Head = newNode
ll.Size++
}
//Removes the corresponding key value pair
func (ll *Linkedlist) remove(str string) bool {
var newNode = ll.Head
if ll.Head == nil {
return false
}
if newNode.Key == str {
ll.Head = ll.Head.Next
ll.Size--
return true
}
for {
if newNode.Next == nil {
break
}
if newNode.Next.Key == str {
newNode.Next = newNode.Next.Next
ll.Size--
return true
}
newNode = newNode.Next
}
return false
}
//To view the contents of a bucket
func (ll *Linkedlist) printlist() {
var newNode = ll.Head
for {
if newNode == nil {
break
}
fmt.Printf("%s,%s -> ", newNode.Key, newNode.Data)
newNode = newNode.Next
}
fmt.Print("\n")
}