396. Rotate Function: 一道数学题,一遍过了
106. Construct Binary Tree from Inorder and Postorder Traversal: 典型的tree的题目,估计也不会考了吧
105. Construct Binary Tree from Preorder and Inorder Traversal: 典型的tree的题目2,估计也不会考了,考了也算是挺简单的
467. Unique Substrings in Wraparound String:这道题的dp还挺巧妙的
207. Course Schedule: 典型的拓扑排序问题
63. Unique Paths II:简单的动态规划,pass
34. Search for a Range: 简单的二分法,pass