题目
Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, …) which sum to n.
Example 1:
Input: n = 12
Output: 3
Explanation: 12 = 4 + 4 + 4.
Example 2:
Input: n = 13
Output: 2
Explanation: 13 = 4 + 9.
代码
class Solution {
public int numSquares(int n) {
int kk = (int)Math.sqrt(n);
int[] a = new int[kk];
for (int i = 0; i < kk; i++) {
a[i] = (i + 1) * (i + 1);
}
int[] dp = new int[n + 1];
dp[0] = 0;
for (int i = 1; i <= n; i++) {
dp[i] = Integer.MAX_VALUE;
for (int j = 0; j < kk; j++) {
if (i - a[j] >= 0) {
dp[i] = Math.min(dp[i - a[j]] + 1, dp[i]);
}
}
}
// for (int i = 1; i <= n; i++) {
// System.out.println(dp[i]);
// }
return dp[n];
}
}