【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?

Note: m and n will be at most 100.

Accept，动态规划

int dp[101][101] = {1};int findpath(int m, int n) {    if (m == 0 || n == 0) {        return 0;    }    if (dp[m][n] > 0) {        return dp[m][n];    }        dp[m][n] = findpath(m - 1, n) + findpath(m, n - 1);    dp[n][m] = dp[m][n];    return dp[m][n];}int uniquePaths(int m, int n) {    dp[1][1] = 1;    return findpath(m, n);}