LeetCode 279. 完全平方数

class Solution {
public:
    int numSquares(int n) {
        vector<int> dp(n + 1, 0);
        for(int i = 1; i <= n; ++i){
            dp[i] = i;  //最坏的情况每次都是1
            for(int j = 1; j * j <= i; ++j){
                dp[i] = min(dp[i] , dp[i - j * j] + 1);
            }
        }
        return dp[n];
    }
};