SunliyMonkey

给定三个字符串S1，S2，S3，判断S3是否能够由S1，S2交错组合而成。考察点：动态规划陷阱：无

题目描述给一棵二叉树，每个节点带有数字，寻找出从根到叶子节点所有的路径，使得路径上的数字之和为给出的sum。考察点：1. 树的遍历2. vector的使用：push_back， pop_back陷阱：无

博客转载请注明地址：题目描述题目地址：https://leetcode.com/problems/kth-smallest-element-in-a-bst/ 在一颗二叉排序树当中，寻找第k大的数。考察点递归树的遍历陷阱无Code/** * Definition for a binary tree node. * struct TreeNode { * int val; *

博客转载请注明地址：题目描述题目地址：https://leetcode.com/problems/median-of-two-sorted-arrays/ 给出两个有序数组，求两个有序数组合并在一起的中位数是多少？考察点二分查找，分治分类讨论思路传统的二分查找在[L，R][L，R]区间求出满足条件的值。该题是一个举一反三，希望在区间([L1,R1],[L2,R2])([L_1,R_1],[L

博客转载请注明地址：http://blog.youkuaiyun.com/sunliymonkey/article/details/48179427题目描述题目地址：https://leetcode.com/problems/binary-tree-maximum-path-sum/一棵二叉树，每个节点上都标有数值，寻找一条路径，使得路径上所有节点的值和最大。样例：输入 1 / \ 2 3输出6

Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 which represents the number 123.

The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray code. A