用数据库的方法找出从入口(左下角方格(0,0))经过迷宫到达出口(右上角方格(7,3))的所有路径。
要求1:只能走到与它相邻(四邻域:上、下、左、右相邻)的上,且不能走重复路径。
要求2:避开方块(3,2)的陷阱。
WITH RECURSIVE
path(x, y, paths) AS (
SELECT 0, 0, CAST(CONCAT('(0, 0)') AS CHAR(1024))
UNION
SELECT x+1, y, CAST(CONCAT(paths, ', ', '(', x+1, ',', y, ')') AS CHAR(1024)) FROM path
WHERE x+1 <= 7 AND NOT (x+1 = 3 AND y = 2)
UNION
SELECT x, y+1, CAST(CONCAT(paths, ', ', '(', x, ',', y+1, ')') AS CHAR(1024)) FROM path
WHERE y+1 <= 3 AND NOT (x = 3 AND y+1 = 2)
)
SELECT paths FROM path WHERE x = 7 AND y = 3;
需要注意path的长度,需要使用CAST来避免数据过长