62. Unique Paths

题目链接

https://leetcode.com/problems/unique-paths/

解题思路

简单dp，直接看代码

代码

class Solution {
public:
    int uniquePaths(int m, int n) {
        vector> dp(m, vector(n, 0));

        for (int i = 0; i < m; ++i) {
            for (int j = 0; j < n; ++j) {
                if (i == 0 || j == 0) {
                    dp[i][j] = 1;
                } else {
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                }
            }
        }
        return dp[m - 1][n - 1];
    }
};