【动态规划】leetcode279 完全平方数
题目详情
动态规划
dp[i] = Math.min(dp[i], dp[i - j * j] + 1)
/***
* 动态规划
* dp[i] = Math.min(dp[i], dp[i - j * j] + 1)
*/
public class Solution {
public int numSquares(int n){
int[] dp = new int[n + 1];
dp[0] = 0;
for(int i = 1; i < n; i ++){
dp[i] = i;
for(int j = 1; i - j * j >= 0; j ++){
dp[i] = Math.min(dp[i], dp[i - j * j] + 1);
}
}
return dp[n];
}
}