for _, v := range dirs {
ni := i + v.x
nj := i + v.y //看清是啥!!!
if ni >= 0 && nj >= 0 && ni < m && nj < n && visited[ni][nj] == false {
if dfs(ni, nj, k+1) {
return true
}
}
}
标签:dirs,ni,nj,false,错误,笔记,&&,return
来源: https://www.cnblogs.com/rush-peng/p/15145926.html