leetcode 279. Perfect Squares

最新推荐文章于 2022-04-09 08:57:14 发布

martin_liang

最新推荐文章于 2022-04-09 08:57:14 发布

阅读量170

点赞数

分类专栏：算法 C++/C leetcode

本文链接：https://blog.csdn.net/martin_liang/article/details/81609156

版权

算法同时被 3 个专栏收录

537 篇文章 1 订阅

订阅专栏

C++/C

504 篇文章 0 订阅

订阅专栏

leetcode

230 篇文章 0 订阅

订阅专栏

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.

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