Saturday, August 29, 2015

MJ [31] minSteps

Question:
Given a grid with 'o' and 'x'. Find minimum steps from top-left to bottom-right without touching 'x'.
   a) You can only move right or move down. (BFS or DP) (m+n-2)?
   b) You can move in all 4 directions. (BFS)


Ref
[1] http://www.mitbbs.com/article_t/JobHunting/33037695.html

No comments:

Post a Comment