hqw11的博客

http://hihocoder.com/contest/ntest2016spring1/problem/1时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 电子数字在生活中很常见，而许多的电子数字是由LED数码管制作而成。数字LED数码管一般由7个发光二极管封装在一起，组成’8’字型，引线在内部连接完成。如下图所示，我们可以对每个发光管进行编

一道很简单的题目，这里只是对比一下几种思路和做法。题目很简单，就是一颗二叉树由0-9数字构成，求所有root->leaf路径组成的数的总和。Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-t...

题目描述Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a timeEach intermediate wo...

题目：Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n ) space is pretty straight forward. Could you devise...

比较简单的二叉树题目，一开始以为需要找从叶节点到另一个叶节点的路径的最大值，但题目实际上说start|end可以是任意节点，实现过程稍微有点不一样，不过思路大致是相同的。题目：Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For examp...