题解 | #迷宫问题#边界处理要仔细

const [row, col] = readline().split(" ").map(Number);
const used = new Array(row).fill(0).map((v) => new Array(col).fill(0));
const arr = [];
let router = [];

let start = [0, 0];
while ((line = readline())) {
  arr.push(line.split(" "));
}
let rr = find(arr, start, router, used);
for (let i = 0; i < rr.length; i++) {
  console.log(`(${rr[i][0]},${rr[i][1]})`);
}

function find(arr, start, router, used) {
  let route = router;
  let use = used;
  let i = start[0];
  let j = start[1];
  if (i == row - 1 && j == col - 1) {
    route.push([row - 1, col - 1]);
    return route;
  }
  if (arr[i][j] == 1) {
    return;
  } else {
    if (use[i][j]) {
      return;
    }
    use[i][j] = 1;
  }
  const zuo = j > 0 ? [i, j - 1] : [];
  const you = j < col-1 ? [i, j + 1] : [];
  const shang = i > 0 ? [i - 1, j] : [];
  const xia = i < row-1 ? [i + 1, j] : [];
  if (shang.length) {
    let res = find(arr, shang, route, use);
    if (res) {
      route.unshift([i, j]);
      return res;
    }
  }
  if (xia.length) {
    let res = find(arr, xia, route, use);
    if (res) {
      route.unshift([i, j]);
      return res;
    }
  }
  if (zuo.length) {
    let res = find(arr, zuo, route, use);
    if (res) {
      route.unshift([i, j]);
      return res;
    }
  }
  if (you.length) {
    let res = find(arr, you, route, use);
    if (res) {
      route.unshift([i, j]);
      return res;
    }
  }
}