2024-05-18 solved

alstjr7437/README.md

@@ -26,4 +26,4 @@
 | 22차시 | 2024.04.13 |  BFS  | <a href="https://www.acmicpc.net/problem/11724">연결 요소의 개수</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/78 |
 | 23차시 | 2024.05.01 |  큐  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/42587">프로세스</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-6/pull/79 |
 | 24차시 | 2024.05.14 |  BFS  | <a href="https://www.acmicpc.net/problem/7576">토마토</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/187 |
-| 25차시 | 2024.05.18 |  힙  | <a href="https://www.acmicpc.net/problem/5430">AC</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/190 |
+| 25차시 | 2024.05.18 |  덱  | <a href="https://www.acmicpc.net/problem/5430">AC</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/190 |

alstjr7437/덱/AC.py

@@ -0,0 +1,41 @@
+from collections import deque
+import sys
+input = sys.stdin.readline
+
+t = int(input())
+
+for _ in range(t):
+    temp_reverse = False
+    error = 0
+
+    p = input()
+    n = int(input())
+    x = deque(input().strip()[1:-1].split(','))
+
+    if n == 0 :
+        x = deque()
+
+    for i in p:
+        if i == 'R':
+            if temp_reverse :
+                temp_reverse = False
+            else :
+                temp_reverse = True
+
+        if i == "D":
+            if len(x) == 0:
+                error = 1
+                break
+            else :
+                if temp_reverse :
+                    x.pop()
+                else :
+                    x.popleft()
+
+    if temp_reverse :
+        x.reverse()
+
+    if error == 0 :
+        print(f"[{','.join(str(i) for i in x)}]")
+    else : 
+        print("error")