给定正整数 n,找到若干个完全平方数(比如 1, 4, 9, 16, …)使得它们的和等于 n。你需要让组成和的完全平方数的个数最少。
示例 1:
输入: n = 12
输出: 3
解释: 12 = 4 + 4 + 4.
示例 2:
输入: n = 13
输出: 2
解释: 13 = 4 + 9.
思路:闫氏DP分析法
套用完全背包模型
f[i][j]表示前i个数中任取几个数,其平方和等于j的集合
属性:min(最小数量)
集合划分:于完全背包思路相同
//出现了AddressSanitizer:DEADLYSIGNAL错误
class Solution {
public:
int numSquares(int n) {
int f[n + 3][n + 3];
for (int i = 0; i <= n; i ++) {
for (int j = 0; j <= n; j ++) {
f[i][j] = 0;
if (j >= 1 && i == 1) f[1][j] = j;
}
}
for (int i = 2; i <= n; i ++) {
for (int j = 1; j <= n; j ++) {
f[i][j] = f[i - 1][j];
if (j >= i * i) f[i][j] = min (f[i][j], f[i][j - i * i] + 1);
}
}
return f[n][n];
}
};
优化代码就通过了,好奇怪啊……
//运行时间高的离谱,超过5%的人……
class Solution {
public:
int numSquares(int n) {
int dp[n + 3];
dp[0] = 0;
for (int j = 1; j <= n; j ++) dp[j] = j;
for (int i = 2; i <= n; i ++) {
for (int j = 1; j <= n; j ++) {
if (j >= i * i) dp[j] = min (dp[j], dp[j - i * i] + 1);
}
}
return dp[n];
}
};
发现用f[i][j]表示成表示前j个数中任取几个数,其平方和等于i的集合 可能更容易写代码
//运行时长超过30%的人,还是很慢
class Solution {
public:
int numSquares(int n) {
vector<int> v(n + 3, 0);
for (int i = 1; i <= n; i ++) v[i] = i;
for (int i = 1; i <= n; i ++) {
for (int j = 1; j * j <= i; j ++) {
v[i] = min(v[i], v[i - j * j] + 1);
}
}
return v[n];
}
};
看的别人的代码,看不懂
//运行时长瞬间超过73%的人。看不懂
class Solution {
public:
int numSquares(int n) {
vector<int> dp(n + 3, 0);
for (int i = 1; i <= n; i ++) {
int MINVAL = INT_MAX - 4;
for (int j = 1; j * j <= i; j ++) MINVAL = min (MINVAL, dp[i - j * j]);
dp[i] = MINVAL + 1;
}
return dp[n];
}
};
复习+更新优化代码
class Solution {
public:
int numSquares(int n) {
vector<int> dp(n + 3, INT_MAX - 4);
dp[0] = 0;
for (int i = 1; i <= sqrt(n); i ++) {
for (int j = i * i; j <= n; j ++) {
dp[j] = min(dp[j], dp[j - i * i] + 1);
}
}
return dp[n];
}
};