每日一题 day 57 (DP topic)

最新推荐文章于 2024-10-03 23:25:47 发布

NP_hard

最新推荐文章于 2024-10-03 23:25:47 发布

阅读量631

点赞数

分类专栏： LeetCode Learning 文章标签：算法

本文链接：https://blog.csdn.net/np_hard/article/details/123698839

版权

本文介绍了算法题目322 - Coin Change，讨论了如何找到找零最少的硬币组合。文章通过错误尝试逐步引导至正确解决方案。

摘要由CSDN通过智能技术生成

文章目录

problem `classical bag problem`
wrong approach `59/188， Greedy`
wrong approach 2 `TLE, recursive`
appraoch 3 `memorize dp`
approach `bag problem , dp`

problem `classical bag problem`

322. Coin Change

You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.

Return 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.

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

Example 1:

Input: coins = [1,2,5], amount = 11
Output: 3
Explanation: 11 = 5 + 5 + 1

Example 2:

Input: coins = [2], amount = 3
Output: -1

Example 3:

Input: coins = [1], amount = 0
Output: 0

wrong approach `59/188， Greedy`

class Solution {
   
public:
    int coinChange(vector<int>& coins, int amount) {
   
        if(coins.size() == 1 ){
   
            if(amount == 0)return 0;
            if(amount < coins[0])return -1;
            if(amount%coins[0])return -1;
        }
        sort(coins.begin(