DP to solve this question


  • 0
    A

    class Solution {
    public:
    int uniquePaths(int m, int n) {
    vector<int> dp(n, 1);
    for (int i = 1; i < m; ++i) {
    for (int j = 1; j < n; ++j) {
    dp[j] += dp[j - 1];
    }
    }
    return dp[n - 1];
    }
    };


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.