279. Perfect Squares

279. Perfect Squares

1. 题目
题目链接

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.

2. 题目分析
给定一个n，找到多个正整数的平方之和为n，要求数量最少的情况。

3. 解题思路
找多个正整数的平方凑齐整数n，像不像给定多种面值的硬币找零，然后要求找最小硬币数？其实是一个性质的问题，那问题来了，我们这个“面值”（平方数）是没有给定的，所以需要自己先把小于n的平方数求出来。然后用硬币数找零的思路解决问题。不了解硬币找零的童鞋可以参考我的另一篇博文322. Coin Change–硬币找零钱问题)

4. 代码实现（java）

package com.algorithm.leetcode.dynamicAllocation;

/**
 * Created by 凌 on 2019/1/28.
 * 注释：279. Perfect Squares
 */
public class NumSquares {
    public static void main(String[] args) {
        int n= 12;
//        int n= 13;
        int result = numSquares(n);
        System.out.println(result);
    }
    public static int numSquares(int n) {
        if (n<1){
            return 0;
        }
        int[] squareList = new int[n];
        int count =1;
        int temp = count * count;
        while (temp <= n){
            squareList[count-1] = temp;
            count++;
            temp = count * count;
        }
        int[] dp =new int[n+1];
        for (int j = 0; j <= n; j++) {
            dp[j] = Integer.MAX_VALUE;
        }
        dp[0]= 0;
        for (int i = 0; i < count-1; i++) {
            for (int j = 1; j <= n; j++) {
                if (j >= squareList[i] && dp[j-squareList[i]] != Integer.MAX_VALUE){
                    dp[j] = Math.min(dp[j], dp[j-squareList[i]]+1);
                }
            }
        }
        return dp[n] == Integer.MAX_VALUE ? -1 : dp[n];
    }
}