Leetcode 62. Unique Paths (cpp)

题目

解法：动态规划

class Solution {
    
public:int uniquePaths(int m, int n) {
    vector<vector<int>> dp(m,vector<int>(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];}
};