2019年6月20日
35.Unique Paths（不同的路径）
摘要： A robot is located at the top-left corner of a *m* x *n* grid (marked 'Start' in the diagram below). The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked 'Finish' in the diagram below). How many possible unique paths are there? 阅读全文
posted @ 2019-06-20 09:38 yjxyy 阅读(134) 评论(0) 推荐(0)