-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathlinked_list.py
More file actions
105 lines (90 loc) · 1.9 KB
/
linked_list.py
File metadata and controls
105 lines (90 loc) · 1.9 KB
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
"""Implement a linked list.
Sources:
* https://leetcode.com/problems/design-linked-list/
* https://www.geeksforgeeks.org/linked-list-set-1-introduction/
* https://www.geeksforgeeks.org/linked-list-set-2-inserting-a-node/
* https://www.geeksforgeeks.org/linked-list-set-3-deleting-node/
"""
class Node:
def __init__(self, val):
self.val = val
self.next = None
class MyLinkedList:
def __init__(self):
self.head = None
def get(self, index):
node = self.head
i = 0
while node:
if i == index:
return node.val
node = node.next
i += 1
return -1
def addAtHead(self, val: int) -> None:
new_node = Node(val)
new_node.next = self.head
self.head = new_node
def addAtTail(self, val: int) -> None:
new_node = Node(val)
if not self.head:
self.head = new_node
return
prev = None
node = self.head
while node:
prev = node
node = node.next
prev.next = new_node
def addAtIndex(self, index: int, val: int) -> None:
if index == 0:
self.addAtHead(val)
return
new_node = Node(val)
prev = None
node = self.head
i = 0
while node:
if i == index:
prev.next = new_node
new_node.next = node
return
prev = node
node = node.next
i += 1
if index == i:
prev.next = new_node
new_node.next = node
def deleteAtIndex(self, index: int) -> None:
if index == 0:
self.head = self.head.next
return
prev = None
node = self.head
i = 0
while node:
if i == index:
prev.next = node.next
return
prev = node
node = node.next
i += 1
def __str__(self):
node = self.head
parts = []
while node:
parts.append(str(node.val))
node = node.next
return "->".join(parts)
if __name__ == "__main__":
ll = MyLinkedList()
ll.addAtTail(6)
ll.addAtHead(7)
ll.addAtHead(1)
ll.addAtTail(4)
ll.addAtIndex(2, 8)
print(ll)
assert ll.__str__() == "1->7->8->6->4"
ll.deleteAtIndex(3)
print(ll)
assert ll.__str__() == "1->7->8->4"