LeetCode动态规划专题：第二十一天

Leetcode377. 组合总和 Ⅳ

class Solution {
public:
    int combinationSum4(vector<int>& nums, int target) {
        vector<long long> f(target + 1);
        f[0] = 1;
        for (int j = 1; j <= target; j ++ )
            for (auto& x : nums) {
                if (j >= x) 
                    f[j] = (f[j] + f[j - x]) % INT_MAX;
            }
        return f[target];
    }
};

class Solution {
public:
    int integerBreak(int n) {
        if (n <= 3) return n - 1;
        else if (n == 4) return 4;
        else {
            if (n % 3 == 0) return pow(3, n / 3);
            else if (n % 3 == 1) return pow(3, n / 3 - 1) * 4;
            else return pow(3, n / 3) * 2;
        }
    }
};

279. 完全平方数

思路一：拉格朗日平方定理

class Solution {
public:
    bool check(int x) {
        int r = sqrt(x);
        return r * r == x;
    }
    int numSquares(int n) {
        if (check(n)) return 1;

        for (int a = 1; a <= n / a; a ++ ) {
            if (check(n - a * a))
                return 2;
        }

        while (n % 4 == 0) n /= 4;
        if (n % 8!= 7) return 3;
        return 4;
    }
};

思路二：动态规划背包问题

class Solution {
public:
    int numSquares(int n) {
        vector<int> f(n + 1);
        for (int i = 1; i <= n; i ++ ) f[i] = i;

        for (int i = 1; i * i <= n; i ++ ) {
            int v = i * i;
            for (int j = v; j <= n; j ++ )
                f[j] = min(f[j], f[j - v] + 1);
        }
        return f[n];
    }
};