-
Notifications
You must be signed in to change notification settings - Fork 0
/
LinkedList.py
130 lines (113 loc) · 3.4 KB
/
LinkedList.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
class Node:
def __init__(self, elem):
self.elem = elem
self.next = None
class LinkedList:
def __init__(self):
self.begin = None
self._size = 0
def append(self, elem):
if self.begin:
pointer = self.begin
while(pointer.next):
pointer = pointer.next
pointer.next = Node(elem)
else:
self.begin = Node(elem)
self._size += 1
def __len__(self):
return self._size
def _getnode(self, index):
pointer = self.begin
for i in range(index):
if pointer:
pointer = pointer.next
else:
raise IndexError('List index out of range')
return pointer
def __getitem__(self, index):
pointer = self._getnode(index)
if pointer:
return pointer.elem
else:
raise IndexError('List index out of range')
def __setitem__(self, index, elem):
pointer = self._getnode(index)
if pointer:
pointer.elem = elem
else:
raise IndexError('List index out of range')
def index(self, elem):
pointer = self.begin
i = 0
while(pointer):
if pointer.elem == elem:
return i
pointer = pointer.next
i += 1
raise ValueError(f'{elem} is not in list')
def insert(self, index, elem):
node = Node(elem)
if index == 0:
node.next = self.begin
self.begin = node
else:
pointer = self._getnode(index - 1)
node.next = pointer.next
pointer.next = node
self._size += 1
def __delitem__(self, elem):
return self.remove(elem)
def remove(self, elem):
if self.begin == None:
raise ValueError(f'{elem} is not in list')
elif self.begin.elem == elem:
self.begin = self.begin.next
self._size -= 1
return True
else:
before = self.begin
pointer = self.begin.next
while(pointer):
if pointer.elem == elem:
before.next = pointer.next
pointer.next = None
self._size -= 1
return True
before = pointer
pointer = pointer.next
raise ValueError(f'{elem} is not in list')
def extend(self, tup):
for i in range(len(tup)):
self.append(tup[i])
def clear(self):
for elem in self:
self.remove(elem)
def __iter__(self):
pointer = self.begin
while pointer:
yield pointer.elem
pointer = pointer.next
def __repr__(self):
r = ''
pointer = self.begin
while(pointer):
r = r + str(pointer.elem) + ' '
pointer = pointer.next
return r
def __str__(self):
return self.__repr__()
if __name__ == '__main__':
# sequencial = []
# sequencial.append(7)
lista = LinkedList()
lista1 = LinkedList()
lista1.append(40)
lista1.append(60)
lista.append([lista1])
lista.append(80)
lista.append(56)
lista.append(32)
lista.append(17)
for l in lista:
print(l)