leetcode 994. 腐烂的橘子 广度优先算法

解题思路：基础的广度优先算法， 需要创建的node 类型应该

包括该位置腐化的时间min， 下一轮腐化的时间等于原有基础上+1；

另外初始化队列时应轮询整个数组，全部放入；

四个方向的坐标需要注意方向。

 

typedef struct {
    int x;
    int y;
    int min;
} node_t;
#define MAX_DIRECTION 4
node_t g_direction[MAX_DIRECTION] = {{0, 1}, {-1, 0}, {0, -1}, {1, 0}};
int bfs(int** nums, int row, int col)
{
    node_t queue[3000] = {0};
    int num = 0;
    int front = 0;
    int rear = 0;
    for (int i = 0; i < row; i++) {
        for (int j = 0; j < col; j++) {
            if(nums[i][j] == 2) {
                node_t tmp;
                tmp.x = i;
                tmp.y = j;
                tmp.min = 0;
                queue[front++] = tmp;
            }
        }
    }
    while (rear < front) {
        node_t node = queue[rear++];
        for (int i = 0; i < MAX_DIRECTION; i++) {
            node_t tmp;
            tmp.x = node.x + g_direction[i].x;
            tmp.y = node.y + g_direction[i].y;
            if (tmp.x < 0 || tmp.x >= row || tmp.y < 0 || tmp.y >= col) {
                continue;
            }
            if (nums[tmp.x][tmp.y] == 1) {
                nums[tmp.x][tmp.y] = 2;
                tmp.min = node.min + 1;
                num = tmp.min > num ? tmp.min : num;
                queue[front++] = tmp;
            }

        }
    }
    return num;
}
int orangesRotting(int** grid, int gridSize, int* gridColSize)
{
    if (grid == NULL || gridSize <= 0 || *gridColSize <= 0) {
        return -1;
    }
    int ret = bfs(grid, gridSize, *gridColSize);

    for (int i = 0; i < gridSize; i++) {
        for (int j = 0; j < *gridColSize; j++) {
            if (grid[i][j] == 1) {
                return -1;
            }
        }
    }
    return ret;
}