Flatten Binary Tree to Linked List
Distinct Subsequences  动态规划
Populating Next Right Pointers in Each Node   设置二叉树节点的Next指针
Pascal's Triangle
Triangle 求从上到下最小路径
Binary Tree Maximum Path Sum  二叉树最大路径和
Sum Root to Leaf Numbers
Single Number II  每个数重复了三次。