标签：
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.
Subscribe to see which companies asked this question
public class Solution { public int uniquePaths(int m, int n) { int[][] count = new int[m][]; for(int i = 0; i<m; ++i) { count[i] = new int[n]; count[i][0] = 1; } for(int i = 0; i<n; ++i) { count[0][i] = 1; } for(int r = 1; r<m; ++r) for(int c = 1; c<n; ++c) count[r][c] = count[r][c-1] + count[r-1][c]; return count[m-1][n-1]; } }
标签：
原文地址：http://www.cnblogs.com/neweracoding/p/5442024.html
