leetcode490题,迷宫,求到某个点是否存在路径
leetcode505题,迷宫II,求到某个点的最小路径count
leetcode994题,腐烂的橘子,求各自中没有新鲜橘子经历的最小分钟数。
算法核心就是
1、写好入队函数的判断
2、写好外面函数入队的场景
3、二维数组需要构造结构体包含x,y坐标
迷宫我用maze[x][y]==2
标识这个区域是否被访问过
迷宫II我用maze[x][y]
来标识到达当前位置所花的时间
迷宫
#define MAXLEN 10000
typedef struct {
int x;
int y;
}Queue;
Queue g_queue[MAXLEN];
int Enqueue(int x, int y, int tail, int **maze)
{
if (maze[x][y] == 2) {
return tail;
}
else {
g_queue[tail].x = x;
g_queue[tail].y = y;
maze[x][y] = 2;
}
return tail + 1;
}
bool hasPath(int** maze, int mazeSize, int* mazeColSize, int* start, int startSize, int* destination, int destinationSize) {
int row, col, head, tail, dx, dy;
if (mazeSize == 0) {
return false;
}
if (start[0] == destination[0] && start[1] == destination[1]) {
return true;
}
row = mazeSize;
col = *mazeColSize;
dx = destination[0];
dy = destination[1];
head = 0;
tail = 0;
g_queue[tail].x = start[0];
g_queue[tail].y = start[1];
maze[g_queue[tail].x][g_queue[tail].y] = 2;
tail++;
int tmpx, tmpy, count;
while (head < tail) {
tmpx = g_queue[head].x;
tmpy = g_queue[head].y;
if (tmpx==dx