[recommend for beginners]clean C++ implementation with detailed explanation


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

  • 0
    2

    Where is the 'detailed explanation'?


Log in to reply
 

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