-
Notifications
You must be signed in to change notification settings - Fork 0
/
linked_list.py
150 lines (130 loc) · 3.08 KB
/
linked_list.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
139
140
141
142
143
144
145
146
147
148
149
#!/usr/bin/env python
#-*- coding:utf-8 -*-
"""
module: linked_list
"""
class LinkedList():
def __init__(self, *args):
self.data = [None, None]
self.tail = self.data
self.length = 0
if len(args) > 0:
for v in args:
self.append(v)
def appand(self, v):
d = [v, self.data[1]]
self.data[1] = d
self.length += 1
return self.length
def append(self, v):
d = [v, None]
self.tail[1] = d
self.tail = d
self.length+=1
return self.length
def upto(self, k):
if self.length <= k:
raise Exception("k: %d is out of list scope: %d" % (k, self.length))
if k < 0:
raise Exception("k: %d < 0" % k)
d = self.data
while k > 0:
d = d[1]
k -= 1
return d
def __getitem__(self, k):
d = self.upto(k)
return d[1][0]
def __iter__(self):
v = self.data[1]
while v != None:
yield v[0]
v = v[1]
def remove(self, k):
d = self.upto(k)
d[1] = d[1][1]
self.length -= 1
if self.tail == d[1]:
self.tail = d
return self.length
def insert(self, k, v):
d = self.upto(k)
d[1] = [v, d[1]]
self.length += 1
return self.length
def update(self, k, v):
d = self.upto(k)
d[1][0] = v
def update_iter(self, condition, replace):
d = self.data[1]
count = 0
while d != None:
if condition(d[0]):
d[0] = replace(d[0])
count += 1
d = d[1]
return count
def remove_iter(self, condition):
d = self.data
count = 0
while d[1] != None:
if condition(d[1][0]):
d[1] = d[1][1]
if self.tail == d[1]:
self.tail = d
count += 1
d = d[1]
return count
def test():
"""
usage:
>>> ll = LinkedList()
>>> [ll.append(v) for v in (1,2,3,4,5)]
[1, 2, 3, 4, 5]
>>> [ll.appand(v) for v in (3,2)]
[6, 7]
>>> ll.length
7
>>> list(ll)
[2, 3, 1, 2, 3, 4, 5]
>>> ll[0]
2
edit:
>>> ll.remove(3)
6
>>> list(ll)
[2, 3, 1, 3, 4, 5]
>>> ll.insert(4, 12)
7
>>> list(ll)
[2, 3, 1, 3, 12, 4, 5]
>>> ll.update(6, 12)
>>> list(ll)
[2, 3, 1, 3, 12, 4, 12]
iter:
>>> ll = LinkedList(1,2,3,4,5,6,7)
>>> ll.update_iter(lambda v: v%2 == 0, lambda v: v/2)
3
>>> list(ll)
[1, 1, 3, 2, 5, 3, 7]
>>> ll = LinkedList(1,2,3,4,5,6,7)
>>> ll.remove_iter(lambda v: v%2 == 0)
3
>>> list(ll)
[1, 3, 5, 7]
error:
>>> ll[12]
Traceback (most recent call last):
...
Exception: k: 12 is out of list scope: 7
>>> ll[-1]
Traceback (most recent call last):
...
Exception: k: -1 < 0
"""
import doctest
doctest.testmod()
def main():
test()
if __name__=="__main__":
main()