暴风影音笔试最后一道题是给你一个n,表示n行n列的表格,然后输出从表格的左上角走到右下角一共有多少条路径?给了一个例子是n=2时,从左上角到右下角一共有6条路径。
方法1:C(2n, n)
方法2:动态规划
#include <iostream>
using namespace std;
int main()
{
int n;
while (cin>>n)
{
int **dp = new int* [n+1];
for (int i=0; i<=n; ++i)
{
dp[i] = new int [n+1];
}
dp[0][0] = 0;
for (int i=1; i<=n; ++i)
{
dp[0][i] = 1;
dp[i][0] = 1;
}
for (int i=1; i<=n; ++i)
{
for (int j=1; j<=n; ++j)
{
dp[i][j] = dp[i-1][j] + dp[i][j-1];
}
}
cout<<dp[n][n]<<endl;
for (int i=0; i<=n; ++i)
{
delete [] dp[i];
}
delete [] dp;
}
system("pause");
return 0;
}