Merge pull request #58 from AlgoLeadMe/14-2secondag

12-2secondag

2secondag/README.md

@@ -13,5 +13,3 @@
 | 9차시 | 2024.01.25 |  수학  | [달팽이는 올라가고 싶다] (https://www.acmicpc.net/problem/2869) | [#37](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/37#event-11619409875)|
 | 10차시 | 2024.01.28 |  구현  | [음계] (https://www.acmicpc.net/problem/2920) | [#39](https://github.com/AlgoLeadMe/AlgoLeadMe-5/pull/39#event-11655882785)|
 | 11차시 | 2024.01.31 |  부루트포스 알고리즘  | [블랙잭] (https://www.acmicpc.net/problem/2798) | [#46]()|
-
----

2secondag/스택/스택.py

@@ -0,0 +1,33 @@
+import sys
+
+N = int(sys.stdin.readline())
+stack = []
+
+for i in range (N):
+  sen = list(map(str, sys.stdin.readline().split()))
+
+  if sen[0] == "push":
+    stack.append(int(sen[1]))
+
+  elif sen[0] == "pop":
+    if len(stack) > 0:
+      print(stack[-1])
+      stack.pop()
+    else:
+      print(-1)
+
+  elif sen[0] == "size":
+    print(len(stack))
+
+  elif sen[0] == "empty":
+    if len(stack) > 0:
+      print(0)
+    else: 
+      print(1)
+
+  elif sen[0] == "top":
+    if len(stack)>0 :
+      print(stack[-1])
+    else:
+      print(-1)
+