LeetCode Hot 100 P62 Unique Paths

---

Timeline

Timeline

2026-03-21

init

Dynamic Programming

---

Problem:

P62 Unique Paths

https://leetcode.cn/problems/unique-paths/description/?envType=study-plan-v2&envId=top-100-liked

Dynamic Programming

#include <vector>
using std::vector;

class Solution {
    public:
        int uniquePaths(int m, int n)
        {
                int i, j;
                vector<vector<int> > dp(m, vector<int>(n, 0));
                // dp[i][j] represents the total number of unique paths to (i,j)
                for (i = 0; i < m; i++)
                        dp[i][0] = 1;

                for (j = 0; j < n; j++)
                        dp[0][j] = 1;

                for (i = 1; i < m; i++) {
                        for (j = 1; j < n; j++)
                                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
                }

                return dp[m - 1][n - 1];
        }
};