279 Perfect Squares

1 题目

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.

2 尝试解

class Solution {
public:
    int numSquares(int n) {
        vector<int> saver(n+1,-1);
        saver[0] = 0;
        vector<int> coins;
        for(int i = 1; i*i <= n; i++){
            coins.push_back(i*i);
        }
        return findCoin(saver,coins,n);
    }
    int findCoin(vector<int> &saver,vector<int> &coins,int target){
        if(saver[target]!=-1) return saver[target];
        if(count(coins.begin(),coins.end(),target)!=0) return 1;
        int result = INT_MAX;
        for(int coin: coins){
            int temp = INT_MAX;
            if(coin <= target){
                temp = 1 + findCoin(saver,coins,target-coin);
            }
            if(temp < result) result = temp;
        }
        saver[target] = result;
        return result;
    }
};

3 标准解

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