脸家 新题 不太会

Given a MxN matrix where each element can either be 0 or 1. We need to print the shortest path between a given source cell to a destination cell. The path can only be created out of a cell if its value is 1.

bfs很简单 面试官要求用dfs 求问咋做
.--

可以用dfs先暴力搜索一下，然后用dp的思路存一下中间量的值当作base case

很正常的dfs啊，可以用记忆化搜索。