[LeetCode] [C++] 62. Unique Paths
There are numbers in each grid in the picture,which stand for the number of unique paths from Start to the grid.Observing the picture,we can easily find that,for any i,j>0,dp[i][j]=dp[i-
原创
2017-12-09 14:00:58 ·
160 阅读 ·
0 评论