Simple DP solution in C++

  • 0
    class Solution {
        int uniquePaths(int m, int n) {
            int dp[100][100];
            dp[0][0] = 1;
            for (int i=0; i<m; i++)
            for (int j=0; j<n; j++)
                if (i && j) dp[i][j] = dp[i-1][j] + dp[i][j-1];
                else if (i) dp[i][j] = dp[i-1][j];
                else if (j) dp[i][j] = dp[i][j-1];
            return dp[m-1][n-1];

Log in to reply

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