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?
思路：
简单的动态规划问题
我的代码：
public class Solution { public int uniquePaths(int m, int n) { if (m == 0 || n == 0) { return 0; } int count[][] = new int[m][n]; for(int i = 0; i < m; i++) { count[i][0] = 1; } for(int j = 0; j < n; j++) { count[0][j] = 1; } for(int i = 1; i < m; i++) { for(int j = 1; j < n; j++) { count[i][j] = count[i-1][j] + count[i][j-1]; } } return count[m-1][n-1]; } }
原文：http://www.cnblogs.com/sunshisonghit/p/4319167.html
