-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCircularLinkedList.py
106 lines (87 loc) · 2.25 KB
/
CircularLinkedList.py
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
#credit: joejames
class Node(object):
def __init__ (self, d, n = None):
self.data = d
self.next_node = n
def get_next (self):
return self.next_node
def set_next (self, n):
self.next_node = n
def get_data (self):
return self.data
def set_data (self, d):
self.data = d
def to_string (self):
return "Node value: " + str(self.data)
class CircularLinkedList (object):
def __init__ (self, r = None):
self.root = r
self.size = 0
def get_size (self):
return self.size
def add (self, d):
if self.get_size() == 0:
self.root = Node(d)
self.root.set_next(self.root)
else:
new_node = Node (d, self.root.get_next())
self.root.set_next(new_node)
self.size += 1
def remove (self, d):
this_node = self.root
prev_node = None
while True:
if this_node.get_data() == d: # found
if prev_node is not None:
prev_node.set_next(this_node.get_next())
else:
while this_node.get_next() != self.root:
this_node = this_node.get_next()
this_node.set_next(self.root.get_next())
self.root = self.root.get_next()
self.size -= 1
return True # data removed
elif this_node.get_next() == self.root:
return False # data not found
prev_node = this_node
this_node = this_node.get_next()
def find (self, d):
this_node = self.root
while True:
if this_node.get_data() == d:
return d
elif this_node.get_next() == self.root:
return False
this_node = this_node.get_next()
def print_list (self):
print ("Print List..........")
if self.root is None:
return
this_node = self.root
print (this_node.to_string())
while this_node.get_next() != self.root:
this_node = this_node.get_next()
print (this_node.to_string())
def main():
myList = CircularLinkedList()
myList.add(5)
myList.add(7)
myList.add(3)
myList.add(8)
myList.add(9)
print("Find 8", myList.find(8))
print("Find 12", myList.find(12))
cur = myList.root
print (cur.to_string())
for i in range(8):
cur = cur.get_next();
print (cur.to_string())
print("size="+str(myList.get_size()))
myList.print_list()
myList.remove(8)
print("size="+str(myList.get_size()))
print("Remove 15", myList.remove(15))
print("size="+str(myList.get_size()))
myList.remove(5) # delete root node
myList.print_list()
main()