- 博客(3)
- 收藏
- 关注
RSS订阅原创 Leetcode 96. Unique Binary Search Trees
Catalan numbers. /** * # of binary trees = (# of trees on LHS) * (# of choices as root) * (# of trees on RHS) * let c[n] be the total # of binary trees * c[0] = c[1] = 1 * choose 1 as root, no e
2016-10-22 13:18:13
175
原创 Leetcode 91. Decode Ways
/** * allocate an array w[n] to save ways of decryption for a message which length is n * suppose a1a2...an-1 is the first n-1 digits of the encoded message and has w[n-1] ways to decode * then for
2016-10-22 07:21:57
232
原创 Leetcode 322. Coin Change
/** * given an array 'c[]' represents coins and a target value 'amount' * suppose the solution for 'amount' is sol(a) which refers to minimum # of conins to reach the amount * easy to know sol(a) = mi
2016-10-19 05:17:37
218
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人