2023 KAKAO BLIND RECRUITMENT 미로 탈출 명령어

문제 링크: https://school.programmers.co.kr/learn/courses/30/lessons/150365

Author: skysign

2023 KAKAO BLIND RECRUITMENT 1,2,3 떨어트리기/main.py

@@ -61,11 +61,10 @@ def solution(edges: List[List[int]], target: List[int]):
     leaves: List[Node] = []
 
     for node_num in nodes.keys():
-        if nodes[node_num]:
-            if len(nodes[node_num].children) > 0:
-                nodes[node_num].children.sort()
-            else:
-                leaves.append(nodes[node_num])
+        if len(nodes[node_num].children) > 0:
+            nodes[node_num].children.sort()
+        else:
+            leaves.append(nodes[node_num])
 
     idx123 = 0
     while True:
@@ -80,7 +79,6 @@ def solution(edges: List[List[int]], target: List[int]):
     answer = [0] * idx123
     for leaf in leaves:
         ans = make_target_from123(len(leaf.indexes123), target[leaf.num - 1])
-        ans.sort()
         for idx in range(len(leaf.indexes123)):
             answer[leaf.indexes123[idx]] = ans[idx]
 

2023 KAKAO BLIND RECRUITMENT 미로 탈출 명령어/main.py

@@ -0,0 +1,43 @@
+import sys
+
+sys.setrecursionlimit(10 ** 9)
+
+
+def solution(n, m, y, x, r, c, k):
+    y, x, r, c = y - 1, x - 1, r - 1, c - 1,
+    min_distance = abs(y - r) + abs(x - c)
+
+    if  min_distance > k:
+        return 'impossible'
+
+    if min_distance % 2 != k % 2:
+        return 'impossible'
+
+    answer = dfs(n, m, y, x, r, c, k, [])
+
+    if None == answer:
+        return 'impossible'
+
+    return ''.join(answer)
+
+
+def dfs(n, m, y, x, dst_y, dst_x, depth, pathes):
+    if depth == 0:
+        if y == dst_y and x == dst_x:
+            return pathes
+        else:
+            return None
+
+    # d: 아래쪽으로, l: 왼쪽으로, r: 오른쪽으로, u: 위쪽으로
+    for dy, dx, dir in [[1, 0, 'd'], [0, -1, 'l'], [0, 1, 'r'], [-1, 0, 'u']]:
+        ny, nx = y + dy, x + dx
+        if 0 <= ny < n and 0 <= nx < m:
+            distance = abs(ny - dst_y) + abs(nx - dst_x)
+            if distance > depth -1:
+                continue
+
+            rtn = dfs(n, m, ny, nx, dst_y, dst_x, depth - 1, pathes + [dir])
+            if rtn != None:
+                return rtn
+
+    return None

2023 KAKAO BLIND RECRUITMENT 미로 탈출 명령어/test_main.py

@@ -0,0 +1,13 @@
+from unittest import TestCase
+from main import solution
+
+
+class Test(TestCase):
+    def test1_solution(self):
+        self.assertEqual("dllrl", solution(3, 4, 2, 3, 3, 1, 5))
+
+    def test2_solution(self):
+        self.assertEqual("dr", solution(2, 2, 1, 1, 2, 2, 2))
+
+    def test3_solution(self):
+        self.assertEqual("impossible", solution(3, 3, 1, 2, 3, 3, 4))

2023 카카오 신입 공채 1차 온라인 코딩 테스트 1,2,3 떨어트리기 Python/main.py

@@ -84,7 +84,7 @@ def solution(edges, targets):
         nodes[parent_number].add_child_node(nodes[child_number])
 
     for idx in range(101):
-        if nodes[idx] is not None and len(nodes[idx].indexes) == 0:
+        if nodes[idx] is not None and len(nodes[idx].children) == 0:
             leaves.append(nodes[idx])
 
     current_index = 0