PythonPractise/queue_with_stack.py at master · absingh31/PythonPractise · GitHub

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
class stack:
	def __init__(self):
		self.items = []

	def is_empty(self):
		return self.items == []

	def pop_s(self):
		x = self.items.pop()
		return x

	def push(self, x):
		(self.items).append(x)

	def min_ele(self):
		return min(self.items)

	def top(self):
		return self.items[-1]

	def size_st(self):
		return len(self.items)

class queue:
	def __init__(self):
		self.ins = stack()
		self.outs = stack()

	def enqueue(self, x):
		self.ins.push(x)

	def min_ele(self):
		return (self.ins.min_ele())

	def dequeue(self):
		if(self.outs.is_empty()):
			while(1):
				if(self.ins.is_empty()==True):
					break
				self.outs.push(self.ins.pop_s())
		self.outs.pop_s()

	def front(self):
		if(self.outs.is_empty()):
			while(1):
				if(self.ins.is_empty()==True):
					break
				self.outs.push(self.ins.pop_s())
		return self.outs.top()


if __name__ == '__main__':
	q1 = queue()
	q1.enqueue(19)
	q1.enqueue(12)
	q1.enqueue(13)
	q1.enqueue(14)
	q1.enqueue(15)

	print(q1.front())