havatrier

bottom-up solution: ```java class Solution { public int numTrees(int n) { // transition equation: // f[n] = sum{ f[i] * f[n-i] } , for i in [1..n] // 即 i依次选择节点1..n为根时，左子树的种类数...