C++ 4ms concise easy to understand code


  • 0
    H
    class Solution {
    public:
        int uniquePaths(int m, int n) {
            vector<vector<int> > dp (m, vector<int> (n, 1)) ; // m * n grid whose each element is initialized to 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] ;
        }
    };

Log in to reply
 

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