Given a positive integer n
, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...
) which sum to n.
Example
Given n = 12
, return 3
because 12 = 4 + 4 + 4
java
public class Solution {
/*
* @param n: a positive integer
* @return: An integer
*/
public int numSquares(int n) {
// write your code here
if (n <= 0) {
return 0;
}
// state
int[] f = new int[n + 1];
// initialize
Arrays.fill(f, Integer.MAX_VALUE);
for (int i = 0; i * i <= n; i++) {
f[i * i] = 1;
}
// function
for (int i = 0; i < n + 1; i++) {
for (int j = 0; i + j * j <= n; j++) {
f[i + j * j] = Math.min(f[i + j * j], f[i] + 1);
}
}
// answer
return f[n];
}
}