-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main.py
138 lines (122 loc) · 4.08 KB
/
Main.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
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
class Node:
def __init__(self, data=None):
self.data = data
self.previous = self
self.next = self
class DoublyCircularLinkedList:
def __init__(self):
self.count = 0
self.front = None
self.end = None
def add_at_tail(self, data) -> bool:
new_node = Node(data)
if self.count > 0:
new_node.previous = self.end
self.end.next = new_node
self.head.previous = new_node
new_node.next = self.head
else:
self.head = new_node
self.end = new_node
self.count += 1
return True
def add_at_head(self, data) -> bool:
new_node = Node(data)
if self.count > 0:
new_node.next = self.head
new_node.previous = self.end
self.head.previous = new_node
self.end.next = new_node
else:
self.end = new_node
self.head = new_node
self.count += 1
return True
def add_at_index(self, index, data) -> bool:
if index < 0 or index >= self.count:
return False
if index == 0:
return self.add_at_head(data)
if index == self.count:
return self.add_at_tail(data)
new_node = Node(data)
curr_node = self.head
for i in range(index):
curr_node = curr_node.next
new_node.previous = curr_node.previous
new_node.next = curr_node
curr_node.previous.next = new_node
curr_node.previous = new_node
self.count += 1
return True
def get(self, index) -> int:
if index < 0 or index >= self.count:
return -1
curr_node = self.head
for i in range(index):
curr_node = curr_node.next
return curr_node.data
def delete_at_index(self, index) -> bool:
if index < 0 or index >= self.count:
return False
if index == 0:
temp = self.head
temp.next.previous = self.end
self.end.next = temp.next
self.head = temp.next
self.count -= 1
return True
if index == self.count - 1:
temp = self.end
self.head.previous = temp.previous
temp.previous.next = self.head
self.end = temp.previous
self.count -= 1
return True
curr_node = self.head
for ind in range(index):
curr_node = curr_node.next
curr_node.previous.next = curr_node.next
curr_node.next.previous = curr_node.previous
self.count -= 1
return True
def get_previous_next(self, index) -> list:
if index < 0 or index >= self.count:
return -1
curr_node = self.head
for ind in range(index):
curr_node = curr_node.next
return [curr_node.previous.data, curr_node.next.data]
# Do not change the following code
operations = []
for specific_operation in input().split(','):
operations.append(specific_operation.strip())
input_data = input()
data = []
iteration_count = 0
for item in input_data.split(', '):
inner_list = []
if item.isnumeric():
data.append(int(item))
elif item.startswith('['):
item = item[1:-1]
for letter in item.split(','):
if letter.isnumeric():
inner_list.append(int(letter))
data.append(inner_list)
obj = DoublyCircularLinkedList()
result = []
for i in range(len(operations)):
if operations[i] == "add_at_head":
result.append(obj.add_at_head(data[i]))
elif operations[i] == "add_at_tail":
result.append(obj.add_at_tail(data[i]))
elif operations[i] == "add_at_index":
result.append(obj.add_at_index(int(data[i][0]), data[i][1]))
elif operations[i] == "get":
result.append(obj.get(data[i]))
elif operations[i] == "get_previous_next":
result.append(obj.get_previous_next(data[i]))
elif operations[i] == 'delete_at_index':
result.append(obj.delete_at_index(data[i]))
print(result)