leetcode_question_62 Unique Paths

发布时间:2017-3-28 8:33:59 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"leetcode_question_62 Unique Paths",主要涉及到leetcode_question_62 Unique Paths方面的内容,对于leetcode_question_62 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? Above is a 3 x 7 grid. How many possible unique paths are there? Note: m and n will be at most 100. class Solution { public: int dp[101][101]; int uniquePaths(int m, int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if(m < 1 || n < 1)return 0; for(int i = 1; i <= m; ++i){ dp[i][1] = 1; } for(int j = 1; j <= n; ++j){ dp[1][j] = 1; } for(int i = 2; i <= m; ++i) for(int j = 2; j <= n; ++j) dp[i][j] = dp[i][j-1]+dp[i-1][j]; return dp[m][n]; } };

上一篇:input subsystem 函数解释
下一篇:

相关文章

相关评论

本站评论功能暂时取消,后续此功能例行通知。

一、不得利用本站危害国家安全、泄露国家秘密,不得侵犯国家社会集体的和公民的合法权益,不得利用本站制作、复制和传播不法有害信息!

二、互相尊重,对自己的言论和行为负责。

好贷网好贷款