-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path707_Design_Linked_List.py
More file actions
94 lines (76 loc) · 2.06 KB
/
Copy path707_Design_Linked_List.py
File metadata and controls
94 lines (76 loc) · 2.06 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
class Node:
def __init__(self, val):
self.val = val
self.next = None
class MyLinkedList:
def __init__(self):
self.head = None
self.tail = None
def get(self, index: int) -> int:
cur = self.head
i = 0
while cur:
if i == index:
return cur.val
i += 1
cur = cur.next
return -1
def addAtHead(self, val: int) -> None:
newNode = Node(val)
if self.head:
newNode.next = self.head
self.head = newNode
else:
self.head = newNode
self.tail = newNode
def addAtTail(self, val: int) -> None:
newNode = Node(val)
if self.tail:
self.tail.next = newNode
self.tail = newNode
else:
self.head = newNode
self.tail = newNode
def addAtIndex(self, index: int, val: int) -> None:
prev = None
cur = self.head
i = 0
if index == 0:
self.addAtHead(val)
return
while cur:
if i == index:
newNode = Node(val)
prev.next = newNode
newNode.next = cur
return
prev = cur
cur = cur.next
i += 1
if i == index:
self.addAtTail(val)
def deleteAtIndex(self, index: int) -> None:
cur = self.head
prev = None
i = 0
if index == 0:
self.head = self.head.next
if self.head is None:
self.tail = None
return
while cur:
if i == index:
prev.next = cur.next
if cur.next is None:
self.tail = prev
return
prev = cur
cur = cur.next
i += 1
# Your MyLinkedList object will be instantiated and called as such:
# obj = MyLinkedList()
# param_1 = obj.get(index)
# obj.addAtHead(val)
# obj.addAtTail(val)
# obj.addAtIndex(index,val)
# obj.deleteAtIndex(index)