279. Perfect Squares

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.

dp[i]=arg min(dp[j^2]+dp[i-j^2]).

public class Solution {
    public int numSquares(int n) {
        int[] dp=new int[n+1];
        int count=1;
        for(int i=1;i<=n;i++){
            if(i==count*count){
                dp[i]=1;
                count++;
            }
            else{
                dp[i]=Integer.MAX_VALUE;
                for(int j=1;j*j<=i;j++){
                    dp[i]=Math.min(dp[i],dp[j*j]+dp[i-j*j]);
                }
            }
        }
        return dp[n];
    }
}

对算法进行改进：dp[j^2]=1

public class Solution {
    public int numSquares(int n) {
        int[] dp=new int[n+1];
        for(int i=1;i<=n;i++){
            dp[i]=Integer.MAX_VALUE;
            for(int j=1;j*j<=i;j++){
                dp[i]=Math.min(dp[i],1+dp[i-j*j]);
            }
        }
        return dp[n];
    }
}