LeetCode – Refresh – Unique Paths

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