标签：style blog ar color os sp for on div
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 else 15 arr[i][j] = arr[i - 1][j] + arr[i][j - 1]; 16 } 17 } 18 19 return arr[m][n]; 20 }
标签：style blog ar color os sp for on div
原文地址：http://www.cnblogs.com/ym65536/p/4161473.html
