Leetcode 62: Unique Paths - iterative DP

leetcode_62c.cpp

#include <iostream>
#include <vector>

using namespace std;

int uniquePaths(int m, int n) {
    if (m == 0 || n == 0) return 0;
    vector<vector<int>> dp(n, vector<int>(m, 1));
    for (int r=1; r<n; ++r) {
        for (int c=1; c<m; ++c) 
            dp[r][c] = dp[r-1][c] + dp[r][c-1];
    }
    return dp[n-1][m-1];
}

int main() {
    int m = 7, n = 3;
    cout << uniquePaths(m, n) << "\n";
    return 0;
}