preview
tags
categories
next
guide
sites
home
archives
github
knives
links
tags
dfs
bfs
leetcode
categories
only title
title and content
leetcode1293
2020-01-27
题解
bfs(推荐)
TODO
dfs
3维数组
4个方向的step优先向右和向下
剪枝
在记录步数的时候同时刷新答案,当步数大于答案时立即放弃