class Solution {
public int numSquares(int n) {
int[] dp = new int[n + 1];
for(int i = 1;i <= n; i++){
dp[i] = i;
for(int j = 1; j < 101;j++){
if(i - j*j >= 0) dp[i] = Math.min(dp[i - j * j] + 1,dp[i]);
else break;
}
}
return dp[n];
}
}
简单!