2024.02.20 solved

wkdghdwns199/README.md

@@ -8,4 +8,5 @@
 | 4차시 | 2024.01.30 |  약수, 배수와 소수 |  <a href="https://www.acmicpc.net/problem/4134">다음 소수</a>  | <a href="">2024.01.30</a> |
 | 5차시 | 2024.02.14 |  약수, 배수와 소수 |  <a href="https://www.acmicpc.net/problem/17103">다음 소수</a>  | <a href="">2024.02.14</a> |
 | 6차시 | 2024.02.16 |  약수, 배수와 소수 |  <a href="https://www.acmicpc.net/problem/13909">창문 닫기</a>  | <a href="">2024.02.16</a> |
+| 7차시 | 2024.02.20 |  스택,큐,덱 |  <a href="https://www.acmicpc.net/problem/24511">queuestack</a>  | <a href="">2024.02.16</a> |
 

wkdghdwns199/스택/ACM-10773.py

@@ -0,0 +1,10 @@
+N = int(input())
+stack = []
+while N:
+    N-=1
+    n = int(input())
+    if (n==0) : stack.pop()
+    else : stack.append(n)
+
+
+print(sum(stack))

wkdghdwns199/스택/ACM-24511.py

@@ -0,0 +1,21 @@
+from collections import deque
+
+# 데이터 받기
+N = int(input())
+queue_stack = list(map(int, input().split()))
+data = list(map(int, input().split()))
+n = int(input())
+numbers = list(map(int, input().split()))
+
+answer = deque()
+
+for i in range(N) :
+    if queue_stack[i] == 0:
+        answer.append(data[i])
+
+for number in numbers :
+    answer.appendleft(number)
+
+
+for _ in range(n) :
+    print(answer.pop(), end=' ')

wkdghdwns199/스택/ACM-28278.py

@@ -0,0 +1,15 @@
+from collections import deque
+import sys
+N = int(sys.stdin.readline())
+deq = deque([])
+while N :
+    N-=1
+    n = list(map(int, sys.stdin.readline().split()))
+    if len(n) > 1 : deq.appendleft(n[1])
+    else :
+        if (n[0] == 2) : 
+            if (len(deq) == 0) : print(-1)
+            else : print(deq.popleft())
+        elif (n[0] == 3) : print(len(deq))
+        elif (n[0] == 4) : print(1 if len(deq) == 0 else 0)
+        elif (n[0] == 5) : print(deq[0] if len(deq) !=0 else -1)