-
Notifications
You must be signed in to change notification settings - Fork 2
/
03_03_orthogonal_b.py
83 lines (66 loc) · 1.84 KB
/
03_03_orthogonal_b.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
class Node:
def __init__(self, data):
self.data = data
self.next = None
class LL:
def __init__(self):
self.head = None
def append(self, data):
new_node = Node(data)
if not self.head:
self.head = new_node
return
current = self.head
while current.next:
current = current.next
current.next = new_node
def search(self, data):
current = self.head
while current:
if current.data == data:
return True
current = current.next
return False
def delete(self, data):
if not self.head:
return
if self.head.data == data:
self.head = self.head.next
return
current = self.head
while current.next:
if current.next.data == data:
current.next = current.next.next
return
current = current.next
def insert(self, data):
new_node = Node(data)
if not self.head:
self.head = new_node
return
if self.head.data > data:
self.head = new_node
return
current = self.head
while current.next and current.next.data < data:
current = current.next
new_node.next = current.next
current.next = new_node
def print(self):
output = []
current = self.head
while current:
output.append(str(current.data))
current = current.next
print('->'.join(output))
# 3 0 0 0 4
# 0 0 2 0 0
# 0 1 0 0 0
# 0 0 0 0 0
# OLL(row, col)
oll = OLL(4, 5)
oll.insert(ONode(3, 0, 0))
oll.insert(ONode(4, 0, 4))
oll.insert(ONode(2, 1, 2))
oll.insert(ONode(1, 2, 1))
oll.print()