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?

Above is a 3 x 7 grid. How many possible unique paths are there?

class Solution {
public:
    int uniquePaths(int m, int n) {
        int pathNum[101][101]={0};
        
        pathNum[1][1] = 1;
        for(int i = 1; i<=m; i++){
            for(int j =1; j<=n; j++){
                if(i!=1 || j!=1)
                pathNum[i][j] = pathNum[i-1][j]+pathNum[i][j-1];
            }
        }
        return pathNum[m][n];
    }
};

 

http://www.cnblogs.com/remlostime/archive/2012/11/15/2772263.html

http://blog.csdn.net/jiadebin890724/article/details/23302123

动态二维数组：

http://www.tuicool.com/articles/R3yyAf