类别:dynamic programming
难度:medium
题目描述
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.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.
算法分析
对于数字n,需要比较能够用哪些平方数组成,因为前面的数字的最小组成数已经算过了,所以可以直接递归使用。
注意:并不是用最大的平方数去拆分数字n得到的数目就一定是最少的,所以需要对比n小的所有平方数的可能组成情况进行遍历。
代码实现
class Solution {
public:
int numSquares(int n) {
// do not initialize the num to be 0, here i initialize them 1000
vector<int> ans(n + 1, 1000);
ans[0] = 0;
for (int i = 1; i <= n; ++i) {
for (int j = 1; i - j * j >= 0; ++j) {
ans[i] = min(ans[i], ans[i - j*j] + 1);
}
}
return ans[n];
}
};