LeetCode学习篇十三——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.
难度：medium 通过率：34.4%

这道题的状态转移方程想了挺久的，也在网上查询了一些资料，通过四平方和定理可以求解，不过这里还是用DP解法，数组count[i]存储i平方和的个数，一个数平方和数最多为他本身，即i个1加起来，所以先将数组初始化，然后一个数最小不是count[i]，就是其之前的某个数加1，得代码如下：时间复杂度：O(n^(3/2))

class Solution {
public:
    int numSquares(int n) {
        vector<int> count(n+1, 0);
        for(int i = 1; i <= n; i++) {
            count[i] = i;
        }
        for(int i = 0; i <=n; i++) {
            for(int j = 1; j*j+i <= n; j++) {
                count[i+j*j] = min(count[i+j*j], count[i]+1);
            }
        }     
        return count[n];
    }
};