BOJ
백준 파이썬 10845 큐
Coding_SJ
2020. 3. 26. 01:32
내 풀이
|
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
|
import sys
class Stack:
def __init__(self):
self.len = 0
self.list = []
def push(self,x):
self.list.append(x)
self.len += 1
def pop(self):
if self.len == 0:
return -1
tmp = self.list[0]
del self.list[0]
self.len -= 1
return tmp
def size(self):
return self.len
def empty(self):
return 1 if self.len == 0 else 0
def front(self):
if self.len == 0:
return -1
else:
return self.list[0]
def back(self):
if self.len == 0:
return -1
else:
return self.list[-1]
stack = Stack()
n = int(sys.stdin.readline())
while n > 0:
n -= 1
a = sys.stdin.readline().split()
if a[0] == 'push':
stack.push(a[1])
elif a[0] == 'front':
print(stack.front())
elif a[0] == 'back':
print(stack.back())
elif a[0] == 'size':
print(stack.size())
elif a[0] == 'empty':
print(stack.empty())
elif a[0] == 'pop':
pr
|
cs |