Since it's very similar to Dijkstra
points: any stoppable points and start point
edges = any possible path between two points
I think it will be O((edges + points) * O(points))
The Maze III
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.