2021年9月4日
[LeetCode] 1210. Minimum Moves to Reach Target with Rotations 穿过迷宫的最少移动次数
摘要： In an n*n grid, there is a snake that spans 2 cells and starts moving from the top left corner at (0, 0) and (0, 1). The grid has empty cells represen 阅读全文
posted @ 2021-09-04 11:09 Grandyang 阅读(574) 评论(0) 推荐(0)
Fork me on GitHub