Find shortest path to destination for knight on NxN chess board using BFS

前端 未结 0 979
醉梦人生
醉梦人生 2020-12-24 02:46

User enters dimension of the board - N, start and finish, marked by "@" and obstacles marked by "#". All visited cells are also marked by "@".

相关标签:
回答
  • 消灭零回复
提交回复
热议问题