设有一row行,col列的棋盘格子,要从左上角a走到右下角b,有多少种不同的走法?
问题比较简单,可以用递归和DP两种方法做。
TALK IS CHEAP!下面直接贴代码!
DP版:
#include<iostream>
#include<vector>
using namespace std;
int atob(int row, int col)
{
vector<vector<int> > a(row, vector<int>(col, 0));
for(int i = 0; i < row; ++i)
a[i][0] = 1;
for(int i = 0; i < col; ++i)
a[0][i] = 1;
for(int i = 1; i < row; ++i)
for(int j = 1; j < col; ++j)
{
a[i][j] = a[i][j - 1] + a[i - 1][j];
}
return a[row - 1][col - 1];
}
int main()
{
int row, col;
cout<<"输入行,列数:\n";
cin >> row >> col;
cout<<"a到b总共有"<<atob(row, col)<<"种路线\n";
return 0;
}
递归版:
#include<iostream>
using namespace std;
int atob(int row, int col)
{
if(row == 1 || col == 1)
return 1;
return atob(row - 1, col) + atob(row, col - 1);
}
int main()
{
int row, col;
cout<<"输入行,列数:\n";
cin >> row >> col;
cout<<"a到b总共有"<<atob(row, col)<<"种路线\n";
return 0;
}