看到题目就想到了dfs,之后就意料之中的超时了,orz
class Solution {
public:
int count=0;
void dfs(int x,int y,int m,int n)
{
if(x==m-1&&y==n-1)
{
count++;
}
if(x>m-1||y>n-1)
{
return ;
}
dfs(x+1,y,m,n);
dfs(x,y+1,m,n);
}
int uniquePaths(int m, int n)
{
dfs(0,0,m,n);
return count;
}
};
然后看题解,大佬们都用的dp,dp好难,菜鸡表示dp我是真的学不会orz
class Solution {
public:
int uniquePaths(int m, int n)
{
vector<vector<int>>dp(m,vector<int>(n));
for (int i = 0; i < m; i++)
{
dp[i][0] = 1;
}
for (int j = 0; j < n; j++)
{
dp[0][j] = 1;
}
for (int i = 1; i < m; i++)
{
for (int j = 1; j < n; j++)
{
dp[i][j] = dp[i - 1][j] + dp[i][j-1];
}
}
return dp[m - 1][n - 1];
}
};