算法设计与结构基础作业第十七周

322.Coin Change

Description：

You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.

Example 1:

coins = [1, 2, 5], amount = 11

return 3 (11 = 5 + 5 + 1)

Example 2:

coins = [2], amount = 3

return -1.

Note: You may assume that you have an infinite number of each kind of coin.

My C++ code：

class Solution {
public:
    int coinChange(vector<int>& coins, int amount) {
        vector<int> m(amount+1, INT_MAX - 1);
        m[0] = 0;
        for(int i = 1; i <= amount; ++i)
        {
            for(int e: coins)
            {
                if(e <= i)
                    m[i] = min(m[i], m[i-e]+1);
            }
        }
        
        return m.back() == INT_MAX - 1 ? -1 : m.back();
    }
};

96.Unique Binary Search Trees

Desxription：

Given n, how many structurally unique BST's (binary search trees) that store values 1...n?

For example: Given n = 3, there are a total of 5 unique BST's.

1         3     3      2      1

    \       /     /      / \      \

     3     2     1      1   3      2

    /     /       \                 \

   2     1         2                 3

分析：

注意到二叉搜索树的性质：左子树所有值小于根节点，右子树所有值大于根节点。这样给出一个有序序列，在建立一棵合法的二叉搜索树时需要将有序序列一分为二，这个过程将递归进行，而树的个数只与有序序列长度有关，并且这样不同划分建立起来的树必然不会相同。在计数过程中会有大量的重复计数，加入记忆化的搜索解决。

My C++ code：

class Solution {
public:
    int numTrees(int n) {
        return m[n] == -1 ? calc(n) : m[n];
    }
    
    int calc(int n)
    {
        int count = 0;
        for(int i = 0; i < n; ++i)
        {
            int tmp = 1;
            tmp *= (m[i] == -1 ? m[i] = calc(i) : m[i]);
            tmp *= (m[n-1-i] == -1 ? m[n-1-i] = calc(n-1-i) : m[n-1-i]);
            count += tmp;
        }
        
        return m[n] = count;
    }
    
    Solution()
    : m(300, -1)
    {
        m[0] = 1;
        m[1] = 1;
    }
    vector<int> m;
};