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
.
显然,时间复杂度为O(n^2)。
代码如下:
class Solution {
public:
int numSquares(int n) {
int i,j;
vector<int> f(n + 1, INT_MAX);
f[0]=0;
for(i=1;i<=n;i++)
{
for(j=1;j*j<=i;j++)
{
f[i]=min(f[i],f[i-j*j]+1);
}
}
return f[n];
}
};