先上题目：12664 Interesting CalculatorThere is an interesting calculator. It has 3 rows of button.? Row 1: button 0, 1, 2, 3, . . . , 9. Pressing each butt...
分类：
其他好文 时间：
2014-08-13 22:00:07
阅读次数：
264
先上题目：12661 Funny Car RacingThere is a funny car racing in a city with n junctions and m directed roads.The funny part is: each road is open and closed...
分类：
其他好文 时间：
2014-08-13 21:55:38
阅读次数：
340
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...
分类：
其他好文 时间：
2014-08-13 18:17:26
阅读次数：
208
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
You should preserve the original relative order of the nodes in each of...
分类：
其他好文 时间：
2014-08-13 15:02:26
阅读次数：
208
Problem Description
Now an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9.
Each time, you can add or minus 1 to any ...
分类：
其他好文 时间：
2014-08-13 14:57:36
阅读次数：
226
Problem Description
FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At e...
分类：
其他好文 时间：
2014-08-13 14:56:46
阅读次数：
236
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =...
分类：
其他好文 时间：
2014-08-13 14:39:26
阅读次数：
153
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu...
分类：
其他好文 时间：
2014-08-13 14:29:46
阅读次数：
165
Populate each next pointer to point to its next right node.
二叉树的结构体里增加了next指针，编写程序，将二叉树里每个节点的next指针指向它右边的节点。...
分类：
其他好文 时间：
2014-08-13 13:16:36
阅读次数：
210
Descriptiontwo hundred silver dollars from the loser.""Being the most powerful man in the country,the king has so nice horses that in each class his h...
分类：
其他好文 时间：
2014-08-13 12:52:16
阅读次数：
204
