LeetCode 279. 完全平方数

leetcode acwing

动态规划 \(O(n\sqrt{n})\)

C++ 代码

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