LeetCode 279. Perfect Squares（动态规划）

279. Perfect Squares

Medium

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.

题意

将一个数n分解为完全平方数的组合，求最少的组合数量

思路

动态规划

代码

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