Careercup - Google面试题 - 5634470967246848 - zhuli19901106 - 博客园
Find a shortest path in a N*N matrix maze from (0,0) to (N,N), assume 1 is passable, 0 is not, 3 is destination, use memorization to cache the result. Here is my code. I am not sure if I am caching it right.
Read full article from Careercup - Google面试题 - 5634470967246848 - zhuli19901106 - 博客园