题目描述
定义超级和函数F如下:
F(0, n) = n,对于所有的正整数n..
F(k, n) = F(k – 1, 1) + F(k – 1, 2) + … + F(k – 1, n),对于所有的正整数k和n.
请实现下面Solution类中计算F(k, n)的函数(1 <= k, n <= 14).
class Solution {
public:
int F(int k, int n) {
}
};
例1:F(1, 3) = 6
例2:F(2, 3) = 10
例3:F(10, 10) = 167960
注意:你只需要提交Solution类的代码,你在本地可以编写main函数测试程序,但不需要提交main函数的代码. 注意不要修改类和函数的名称.
解题思路
动态规划。
F函数可以转化为如下的递推式
F(k, n) = F(k, n-1) + F(k-1, n)
边界条件为F(0, n) = n
和 F(n, 0) = 0
AC代码
// Problem#: 20616
// Submission#: 5142016
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
class Solution {
public:
int F(int k, int n) {
if (k < 1 || k > 14 || n < 1 || n > 14)
return 0;
int dp[20][20];
for (int i = 0; i < 20; ++i) {
dp[0][i] = i;
dp[i][0] = 0;
}
for (int i = 1; i <= k; ++i) {
for (int j = 1; j <= n; ++j) {
dp[i][j] = dp[i][j - 1] + dp[i - 1][j];
}
}
return dp[k][n];
}
};