|
|
back to boardAfter hours of hard work, I got AC.(+) The algo is DP + search. Use DP in different floor. Use search in the same floor to make sure that no grid will visit twice. I think my algo is O(n), although the coefficient may be a little large... It got AC in 0.14sec. I will continue thinking of this problem to make my pro faster:) Re: After hours of hard work, I got AC.(+) Are you sure? What does your "n" stands for ..? |
|
|