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.

寻找有最少个数的平方数组成的整个数n。

class Solution {
public:
    int numSquares(int n) 
    {
        int *temp=new int[n+1];
        int min=0;
        *temp=0;
        for(int i=0;i<n+1;i++)
            temp[i]=0;
     
        for(int i=1;i<=sqrt(n);i++)
        {
            temp[i*i]=1;
        }
        
        for(int i=2;i<=n;i++)
        {
            if(temp[i]!=1)
            {
                min=10000;
                for(int j=1;j*j<i;j++)
                {
                    int a=temp[j*j]+temp[i-j*j];
                    if(a<min)
                        min=a;
                }
                temp[i]=min;
            }
        }
        int res=temp[n];
        delete []temp;
        return res;
        
    }
};