Cut Off Trees for Golf Event
@shawngao in Java
int start = new int;
Initialzes the list with 0 right?
Thanks for the solution!
@StefanPochmann Thanks. I am reading it now. Interesting A* algorithm.
Never heard this algorithm before. Thanks for sharing. I tried to use Bi-direction BFS during contest but it's even slower (got TLE) than normal BFS. Maybe caused by my bad implementation.
@wufangjie Ah, ok. You meant there can be many ground cells. Yes, I agree that that's allowed.
@SanD I think it's O(m^2n^2) in the worst case.
I re-submit your code, it's TLE....
@byxiangfei please ignore this, i was wrong, the question doesn't require '5' as the blocker, it still can walk through.
No one has replied
@ManuelP Well, then it must be very difficult for your colleagues to work with you, cause even they explain something, you are still struggling :)
@kk636 thanks. fixed.
Think of DFS for a long time,....... In the end, I change it to BFS. Then it is right.
Disabled Categories are greyed out
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.