首页 > 代码库 > leetcode. Unique Paths
leetcode. 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?
只能left->right或top->bottom，因此
arr[i][j] = arr[i - 1][j] + arr[i][j - 1]
即可。
1 int uniquePaths(int m, int n) 2 { 3 if (m <= 0 || n <= 0) 4 return 0; 5 6 int arr[101][101] = {0}; 7 8 for (int i = 1; i <= m; i++) 9 {10 for (int j = 1; j <= n; j++)11 {12 if (i == 1 && j == 1)13 arr[i][j] = 1;14 else15 arr[i][j] = arr[i - 1][j] + arr[i][j - 1];16 }17 }18 19 return arr[m][n];20 }
leetcode. Unique Paths
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。