forked from prabhupant/python-ds
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdeque.py
More file actions
68 lines (49 loc) · 1.4 KB
/
Copy pathdeque.py
File metadata and controls
68 lines (49 loc) · 1.4 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
class Deque():
def __init__(self):
self.data = list()
def push_front(self, elem):
temp = list()
temp.append(elem)
for i in self.data:
temp.append(i)
self.data = temp
def push_back(self, elem):
self.data.append(elem)
def pop_front(self):
temp = list()
for i in range(0, len(self.data)):
if not i==0:
temp.append(self.data[i])
self.data = temp
def pop_back(self):
temp = list()
for i in range(0, len(self.data)):
if not i==len(self.data)-1:
temp.append(self.data[i])
self.data = temp
def get_first(self):
if(len(self.data)>0):
return self.data[0]
else:
return "Deque is empty"
def get_last(self):
if(len(self.data)>0):
return self.data[len(self.data)-1]
else:
return "Deque is empty"
def size(self):
return len(self.data)
def isEmpty(self):
if len(self.data) == 0:
return True
return False
def contains(self, elem):
for i in self.data:
if i==elem:
return True
return False
def printElems(self):
result = ""
for i in self.data:
result += str(i) + " | "
print(result)