Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al...
分类：
其他好文 时间：
2014-08-16 00:59:49
阅读次数：
179
Problem Description:
Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
You must do this in-place without altering the nodes' values.
For example,
Given...
分类：
其他好文 时间：
2014-08-15 22:34:39
阅读次数：
330
历史不容假设[问题描述]Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3retu...
分类：
其他好文 时间：
2014-08-14 19:30:29
阅读次数：
191
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example, Given 1->2...
分类：
其他好文 时间：
2014-08-14 01:01:07
阅读次数：
230
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 o...
分类：
其他好文 时间：
2014-08-14 00:56:47
阅读次数：
199
上帝和每个人开的玩笑都不一样[问题描述]Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first...
分类：
其他好文 时间：
2014-08-13 22:15:17
阅读次数：
221
Dictionary dicNodes = new Dictionary(); foreach (XmlNode node in nodes.ChildNodes) { if (node.NodeType==XmlNodeType.Element) ...
分类：
其他好文 时间：
2014-08-13 18:14:36
阅读次数：
166
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
Power NetworkTime Limit:2000MSMemory Limit:32768KTotal Submissions:22987Accepted:12039DescriptionA power network consists of nodes (power stations, co...
分类：
Web程序 时间：
2014-08-11 23:49:53
阅读次数：
480
Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For e...
分类：
其他好文 时间：
2014-08-11 14:44:32
阅读次数：
186
