Introduction - If you have any usage issues, please Google them yourself
Use the order of the queue and maze shortest path. move [] array of four directions of temptation, the first line of the input data maze of data size n (1 <n<=20)行m(1<m<=20)列,S是出发点,D是迷宫的出口,.号表示通路,X表示墙体不通,输出的数据表示从入口到出口最少需要走k步或没有通路