life is like a box of chocolates you never know what you re gonna get

Coin Changing Problem _dp

Find the minimum number of coins to make change for n cents using coins of denominations d1, d2,.., dm. The coins can be used any number of times. ...

2018-04-03 15:46:29

阅读数 23

评论数 0

Matrix Chain Multiplication _dp

Matrix-chain Multiplication The goal of the matrix-chain multiplication problem is to find the most efficient way to multiply given n matrices M1,...

2018-04-03 15:21:07

阅读数 17

评论数 0

Longest Common Subsequence _dp

For given two sequences X and Y, a sequence Z is a common subsequence of X and Y if Z is a subsequence of both X and Y. For example, if X={a,b,c,b,d,...

2018-04-02 22:26:47

阅读数 70

评论数 0

Exhaustive Search dfs

Write a program which reads a sequence A of n elements and an integer M, and outputs "yes" if you can make M by adding elements in...

2018-04-02 21:40:08

阅读数 31

评论数 0

取消 删除