LeetCode – Refresh – Unique Paths

 1 class Solution {
 2 public:
 3     int uniquePaths(int m, int n) {
 4         vector<int> dp(m, 1);
 5         for (int i = 1; i < n; i++) {
 6             for (int j = 0; j < m; j++) {
 7                 if (j == 0) continue;
 8                 else dp[j] += dp[j-1];
 9             }
10         }
11         return dp[m-1];
12     }
13 };