LeetCode June Challenge - Day 29

Problem: LeetCode June Challenge - Day 29

Ideas

  1. Standard DP problem.

Solution:

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