[Algorithm] Programmers :: 무인도 여행

https://school.programmers.co.kr/learn/courses/30/lessons/154540

프로그래머스

struct Node
{
    int y;
    int x;
};
 
vector<string> arr;
int arrRow;
int arrCol;
int dir[4][2] = { {-1,0}, {1,0}, {0,-1}, {0,1} };
 
 
int BFS(int startY, int startX)
{
    int result = 0;
 
    queue<Node> q;
    q.push({ startY,startX });
    result += arr[startY][startX] - '0';
    arr[startY][startX] = 'X';
 
    while (!q.empty())
    {
        int curY = q.front().y;
        int curX = q.front().x;
        q.pop();
 
        for (int i = 0; i < 4; ++i)
        {
            int nextY = curY + dir[i][0];
            int nextX = curX + dir[i][1];
 
            if (nextY < 0 || nextY >= arrRow) continue;
            if (nextX < 0 || nextX >= arrCol) continue;
            if (arr[nextY][nextX] == 'X') continue;
 
            result += arr[nextY][nextX] - '0';
            arr[nextY][nextX] = 'X';
            q.push({ nextY,nextX });
        }
    }
 
    return result;
}
 
vector<int> solution(vector<string> maps) {
    vector<int> answer;
 
    arr = maps;
    arrRow = maps.size();
    arrCol = maps[0].size();
 
    for (int i = 0; i < arrRow; ++i)
    {
        for (int j = 0; j < arrCol; ++j)
        {
            if (arr[i][j] != 'X')
            {
                int temp = BFS(i, j);
                answer.push_back(temp);
            }
        }
    }
 
    sort(answer.begin(), answer.end());
 
    if (answer.size() == 0)
    {
        answer.push_back(-1);
    }
    return answer;
}

 

기본적인 탐색문제.