🐜 Study: 방의 개수 (#86)

Author: ing-eoking

ing-eoking/방의 개수.py

@@ -0,0 +1,13 @@
+def solution(arrows):
+    dx = [0, 1, 1, 1, 0, -1, -1, -1]
+    dy = [1, 1, 0, -1, -1, -1, 0, 1]
+    vertex, edge = {(0, 0)}, set()
+    x, y = 0, 0
+    for arrow in arrows:
+        for _ in range(2):
+            nx, ny = x + dx[arrow], y + dy[arrow]
+            a, b = (x, y), (nx, ny)
+            edge.add(tuple(sorted([a, b])))
+            vertex.add((nx, ny))
+            x, y = nx, ny
+    return 1 - len(vertex) + len(edge)