本题和63. 不同路径 II - 力扣(LeetCode)一模一样不过要自己写一个障碍数组罢了
注意马自己算障碍,不能去吃马,注意开long long!
ACcode:
#include <iostream>
#define int long long
using namespace std;
int dp[21][21]={0};//表示从(0,0)->(i,j)的路径条数为dp[i][j]
int obs[21][21]={0};//马踏数组
signed main()
{
int n,m,x,y;
cin>>n>>m>>x>>y;
//填充马踏数组
obs[x][y]=1;//注意此处,卒不能去吃马的,马要占一个坑
if(x-2>=0&&y-1>=0) obs[x-2][y-1]=1;
if(x-2>=0&&y+1<=m) obs[x-2][y+1]=1;
if(x-1>=0&&y-2>=0) obs[x-1][y-2]=1;
if(x-1>=0&&y+2<=m) obs[x-1][y+2]=1;
if(x+1<=n&&y-2>=0) obs[x+1][y-2]=1;
if(x+1<=n&&y+2<=m) obs[x+1][y+2]=1;
if(x+2<=n&&y-1>=0) obs[x+2][y-1]=1;
if(x+2<=n&&y+1<=m) obs[x+2][y+1]=1;
//终点和起点有,那就没必要了
if(obs[0][0]==1||obs[n][m]==1){
cout<<"0";
return 0;
}
//初始化
dp[0][0]=1;
int i;
for(i=1;i<=m;i++){
if(obs[0][i]==0) dp[0][i]=1;
else break;
}
for(i;i<=m;i++) dp[0][i]=0;
for(i=1;i<=n;i++){
if(obs[i][0]==0) dp[i][0]=1;
else break;
}
for(i;i<=n;i++) dp[i][0]=0;
for(int j=1;j<=n;j++){
for(int k=1;k<=m;k++){
if(obs[j][k]!=1) dp[j][k]=dp[j-1][k]+dp[j][k-1]; //从上面走来的方法+从左边走来的方法
else dp[j][k]=0;
}
}
cout<<dp[n][m];
return 0;
}