-
Notifications
You must be signed in to change notification settings - Fork 0
/
solution.py
71 lines (61 loc) · 1.79 KB
/
solution.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
class ListNode(object):
def __init__(self, val):
self.val = val
self.next = None
class MyLinkedList:
def __init__(self):
self.head = None
self.size = 0
def get(self, index: int) -> int:
if index < 0 or index >= self.size or self.head == None:
return -1
curr = self.head
for _ in range(index):
curr = curr.next
return curr.val
def addAtHead(self, val: int) -> None:
node = ListNode(val)
node.next = self.head
self.head = node
self.size += 1
def addAtTail(self, val: int) -> None:
node = ListNode(val)
curr = self.head
if not curr:
self.head = node
else:
while curr.next:
curr = curr.next
curr.next = node
self.size += 1
def addAtIndex(self, index: int, val: int) -> None:
if index < 0 or index > self.size:
return
if index == 0:
self.addAtHead(val)
else:
curr = self.head
for _ in range(index - 1):
curr = curr.next
node = ListNode(val)
node.next = curr.next
curr.next = node
self.size += 1
def deleteAtIndex(self, index: int) -> None:
if index < 0 or index >= self.size:
return
if index == 0:
self.head = self.head.next
else:
curr = self.head
for _ in range(index - 1):
curr = curr.next
curr.next = curr.next.next
self.size -= 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)