279. Perfect Squares（图解）

279. Perfect Squares

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.

Solution

C++

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

Explanation