摘要： 需要注意特殊案例的是：最后走到入口出时，步数为 0 。#include #include #define M 12char move_map[4] = {'N','S','E','W'};int move_do[4][2] = {-1,0,1,0,0,1,0,-1};char map[M][M];int step[M][M];int row,col,in,re_step,re_round;int jud(int r, int c){ if(rrow-1 || ccol-1) return 0; return 1;}void dfs 阅读全文