Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.
For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n = 13, return 2 because 13 = 4 + 9.
中文意思就是:给定了一个正整数n , 要求用最少个数的平方数相加的方法重构出来。比如 n=12 时,因为 12=4+4+4, 有三个数相加所以返回 3, n=13 时, 13=4+9 , 返回 2 。
思路解析: 这是一个动态规划问题(dp),初始化时令dp[i * i] = 1,状态转移方程为dp[i + j * j] = min(dp[i] + 1, dp[i + j * j]);
class Solution {
public:
int numSquares(int n) {
vector<int> dp(n + 1, 0x7fffffff);
for (int i = 0; i * i <= n; i++)
{
dp[i * i] = 1;
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; i + j * j <= n; j++)
{
dp[i + j * j] = min(dp[i] + 1, dp[i + j * j]);
}
}
return dp[n];
}
};