LeetCode-279. Perfect Squares [C++][Java]

最新推荐文章于 2026-06-22 21:27:43 发布

原创最新推荐文章于 2026-06-22 21:27:43 发布 · 2.9k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode #java #动态规划

收录于

LeetCode刷题怪专栏收录该内容

247 篇文章

订阅专栏

这篇博客介绍了LeetCode上的第279题，题目要求找到将一个整数n拆分成若干个完美平方数的最小数量。文中给出了C++和Java两种解法，使用动态规划求解，通过遍历所有可能的完美平方数组合，找到消耗完美平方数最少的方案。

LeetCode-279. Perfect Squareshttps://leetcode.com/problems/perfect-squares/

题目描述

Given an integer n, return the least number of perfect square numbers that sum to n.

A perfect square is an integer that is the square of an integer; in other words, it is the product of some integer with itself. For example, 1, 4, 9, and 16 are perfect squares while 3 and 11 are not.

Example 1:

Input: n = 12
Output: 3
Explanation: 12 = 4 + 4 + 4.

Example 2:

Input: n = 13
Output: 2
Explanation: 13 = 4 + 9.

Constraints:

1 <= n <= 10^4

解题思路

【C++】

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

【Java】

class Solution {
    public int numSquares(int n) {
        int[] dp = new int[n + 1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j * j <= i; ++j) {
                dp[i] = Math.min(dp[i], dp[i - j * j] + 1);
            }
        }
        return dp[n];
    }
}