Repository navigation
Expand file tree
/
Copy pathMyLinkedList.py
More file actions
80 lines (66 loc) · 2.02 KB
/
Copy pathMyLinkedList.py
File metadata and controls
80 lines (66 loc) · 2.02 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
class Node:
def __init__(self,val=0,next=None):
self.val = val
self.next = next
class MyLinkedList:
def __init__(self):
self.head = None
def get(self, index: int) -> int:
if not self.head: return -1
count = 0
curr = self.head
while curr and count<index:
count += 1
curr = curr.next
return curr.val if count == index and curr else -1
def addAtHead(self, val: int) -> None:
if not self.head:
self.head = Node(val)
return
prevHead = self.head
self.head = Node(val)
self.head.next = prevHead
def addAtTail(self, val: int) -> None:
newNode = Node(val)
if not self.head:
self.head = newNode
return
curr = self.head
while curr:
prev = curr
curr = curr.next
prev.next = newNode
def addAtIndex(self, index: int, val: int) -> None:
curr = self.head
count = 0
while curr and count < index:
prev = curr
curr = curr.next
count += 1
if count == index:
newNode = Node(val)
if curr == self.head:
newNode.next = curr
self.head = newNode
else:
newNode.next = prev.next
prev.next = newNode
def deleteAtIndex(self, index: int) -> None:
curr = self.head
count = 0
while curr and count < index:
prev = curr
curr = curr.next
count += 1
if count == index and curr:
if curr == self.head:
self.head = self.head.next
else:
prev.next = curr.next
# 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)