美文网首页
coin change

coin change

作者: luomoxyz | 来源:发表于2016-12-07 11:37 被阅读27次

最简单的DP

package main
import "fmt"

func main() {
 //Enter your code here. Read input from STDIN. Print output to STDOUT
    var sum int
    var num int
    fmt.Scanln(&sum, &num)
    arr := make([]int, 0, num)
    for i := 0; i < num; i++ {
        var t int
        fmt.Scanf("%d", &t)
        arr = append(arr, t)
    }
    //var result int
    //recurit(arr, sum, &result)

    var dp = make([]int, sum+1)
    dp[0] = 1
    for i := 0; i < num; i++ {
        var coin = arr[i]
        for j := coin; j < len(dp); j++ {
            dp[j] += dp[j-coin]
        }
    }
    fmt.Println(dp[sum])
}

相关文章

  • leetcode-12

    Coin Change Boundary: There may be no possible change, so...

  • Coin Change

    题目You are given coins of different denominations and a to...

  • Coin Change

    题目来源一道简单的DP题,n种硬币,要求组成某个数值的硬币数最少,代码如下: 看了下讨论区,感觉可以写的更简洁一下...

  • coin change

    最简单的DP

  • coin change

    You are given coins of different denominations and a tota...

  • 322、Coin Change

    参考 [LeetCode] Coin Change 硬币找零 题目描述:You are given coins o...

  • LeetCode Coin Change

    You are given coins of different denominations and a tota...

  • coin change问题

    最简单的模式,不限定硬币使用的次数! 符合动态规划的要求,最优子问题。即10块的时候最优,必然要求小于10块都是最...

  • Coin Change 2

    题目来源给一个钱数以及一些硬币,硬币可以无限取,问有多少种组合方案。一看就是一道DP题,但是太久没刷题,手生。导致...

  • Coin Change 2

    You are given coins of different denominations and a tota...

网友评论

      本文标题:coin change

      本文链接:https://www.haomeiwen.com/subject/uxpdmttx.html