프로그래머스 - 무인도 여행 (L2)

 1from collections import deque
 2
 3vx = [0, 0, -1, 1]
 4vy = [-1, 1, 0, 0]
 5
 6def solution(maps):
 7    N = len(maps)
 8    M = len(maps[0])
 9    answer = []
10
11    visited = [[False]*M for _ in range(N)]
12
13    for i in range(N):
14        for j in range(M):
15            if maps[i][j] != 'X' and not visited[i][j]:
16                cnt = 0
17                q = deque()
18                q.append((j, i))
19                visited[i][j] = True
20                while q:
21                    cx, cy = q.popleft()
22                    cnt += int(maps[cy][cx])
23                    for k in range(4):
24                        nx = cx + vx[k]
25                        ny = cy + vy[k]
26                        if 0 <= nx < M and 0 <= ny < N and maps[ny][nx] != 'X' and not visited[ny][nx]:
27                            q.append((nx, ny))
28                            visited[ny][nx] = True
29                answer.append(cnt)
30    if len(answer) == 0:
31        return [-1]
32    return sorted(answer)