solve : 10828 스택

python/boj_10828.py

@@ -0,0 +1,37 @@
+import sys
+
+input = sys.stdin.readline
+
+
+def solution(n):
+    stack = []
+    for i in range(n):
+        command = input().split()
+
+        if command[0] == 'push':
+            stack.append(command[1])
+        elif command[0] == 'pop':
+            if len(stack) == 0:
+                print(-1)
+            else:
+                print(stack.pop())
+        elif command[0] == 'size':
+            print(len(stack))
+        elif command[0] == 'empty':
+            if len(stack) == 0:
+                print(1)
+            else:
+                print(0)
+        elif command[0] == 'top':
+            if len(stack) == 0:
+                print(-1)
+            else:
+                print(stack[-1])
+
+
+def main():
+    n = int(input())
+    solution(n)
+
+
+main()