-
Notifications
You must be signed in to change notification settings - Fork 35
/
designLinkedList.py
88 lines (70 loc) · 2.03 KB
/
designLinkedList.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
83
84
85
86
87
88
class node:
def __init__(self,data):
self.data=data
self.next=None
class MyLinkedList:
def __init__(self):
self.head=None
self.len=0
def get(self, index: int) -> int:
if index<0 or index>self.len:
return -1
count=0
current=self.head
while current!=None:
if count==index:
return current.data
count+=1
current=current.next
return -1
def addAtHead(self, val: int) -> None:
nod=node(val)
if self.head==None:
self.head=nod
self.len+=1
else:
nod.next= self.head
self.head=nod
self.len+=1
def addAtTail(self, val: int) -> None:
put=node(val)
if self.head==None:
self.head=put
self.len+=1
else:
current=self.head
while current.next!=None:
current=current.next
current.next=put
self.len+=1
def addAtIndex(self, index: int, val: int) -> None:
if index < 0 or index > self.len:
return
if index == 0:
self.addAtHead(val)
else:
new = node(val)
current = self.head
for i in range(index - 1):
current = current.next
new.next = current.next
current.next = new
self.len += 1
def deleteAtIndex(self, index: int) -> None:
if index < 0 or index >= self.len:
return
if index == 0:
self.head = self.head.next
else:
current = self.head
for i in range(index - 1):
current = current.next
current.next = current.next.next
self.len -= 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)