【DP】279. Perfect Squares

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

猜你喜欢

转载自blog.csdn.net/leetcodecl/article/details/81123589