forked from adnanaziz/EPIJudge
-
Notifications
You must be signed in to change notification settings - Fork 0
/
list_node.py
55 lines (43 loc) · 1.21 KB
/
list_node.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
class ListNode:
def __init__(self, data=0, next=None):
self.data = data
self.next = next
def __eq__(self, other):
a, b = self, other
while a and b:
if a.data != b.data:
return False
a, b = a.next, b.next
return a is None and b is None
def __repr__(self):
node = self
visited = set()
first = True
result = ''
while node:
if first:
first = False
else:
result += ' -> '
if id(node) in visited:
if node.next is not node:
result += str(node.data)
result += ' -> ... -> '
result += str(node.data)
result += ' -> ...'
break
else:
result += str(node.data)
visited.add(id(node))
node = node.next
return result
def __str__(self):
return self.__repr__()
def list_size(node):
result = 0
visited = set()
while node is not None and id(node) not in visited:
result += 1
visited.add(id(node))
node = node.next
return result