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.

Example 1:

Input: n = 12
Output: 3 
Explanation: 12 = 4 + 4 + 4.
Example 2:

Input: n = 13
Output: 2
Explanation: 13 = 4 + 9.

这题可以用动态规划，min_squ = min(min_squ, ret[i - j * j] + 1) 其中j*j属于[1, i];

class Solution {
public:
    int numSquares(int n) {
        vector<int> ret(n+1, 0);

        for(int i = 1; i <= n; ++i)
        {
            int min_squ = INT_MAX;
            for(int j = 1; j*j <= i; ++j)
            {
                min_squ = min(min_squ, ret[i - j * j] + 1);
            }
            ret[i] = min_squ;
        }
        return ret[n];
    }
};

因为每次查找前面的数都是一样的，因此可以保留给下一次用，所以可以设置ret为静态成员，这样很多时候都不需要重复计算了。不设为静态变量，时间是138ms，设置了静态变量后，时间为11ms，速度提升十几倍。

class Solution {
public:
    //vector<int> ret;
    int numSquares(int n) {
        static vector<int> ret; //(n+1, 0);
        if(ret.size() == 0)
            ret.push_back(0);

        for(int i = ret.size(); i <= n; ++i)
        {
            int min_squ = INT_MAX;
            for(int j = 1; j*j <= i; ++j)
            {
                min_squ = min(min_squ, ret[i - j * j] + 1);
            }
            ret.push_back(min_squ);
        }
        return ret[n];
    }
};