zoukankan      html  css  js  c++  java
  • 518. Coin Change 2 方案总数

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

    Return the number of combinations that make up that amount. If that amount of money cannot be made up by any combination of the coins, return 0.

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

    The answer is guaranteed to fit into a signed 32-bit integer.

     

    Example 1:

    Input: amount = 5, coins = [1,2,5]
    Output: 4
    Explanation: there are four ways to make up the amount:
    5=5
    5=2+2+1
    5=2+1+1+1
    5=1+1+1+1+1
    

    Example 2:

    Input: amount = 3, coins = [2]
    Output: 0
    Explanation: the amount of 3 cannot be made up just with coins of 2.
    

    Example 3:

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

    笨数
    //https://leetcode.com/problems/coin-change-2/discuss/176706/Beginner-Mistake%3A-Why-an-inner-loop-for-coins-doensn't-work-Java-Soln
    class Solution {
        public int change(int amount, int[] coins) {
            int [] combi = new int[amount+1];
            combi[0] = 1;
            for(int i = 0; i < coins.length; i++){
                for(int j=1; j< amount+1; j++){
                    if(j-coins[i]>=0)
                        combi[j] = combi[j]+combi[j-coins[i]];
                }
            }
            for(int a: combi)
                System.out.print(a+" ");
            return combi[amount];
        }
    }
     
  • 相关阅读:
    Pycharm激活
    初识HTML
    软件测试之性能测试应用领域
    剑指offer学习
    编译PC版本的C程序
    嵌入式Linux中Socket套接口开发
    win7安装ubuntu,如何设置win7为默认启动项
    struct v4l2_buffer
    dpkg命令查看 sudo apt-get install ~~ 安装的软件路径
    Missing table when do SQL data compare
  • 原文地址:https://www.cnblogs.com/immiao0319/p/15491865.html
Copyright © 2011-2022 走看看