原题地址：http://oj.leetcode.com/problems/swap-nodes-in-pairs/Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2...
分类：
编程语言 时间：
2014-09-15 06:38:18
阅读次数：
200
Merge Two Sorted Lists: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 fi...
分类：
编程语言 时间：
2014-09-15 01:02:17
阅读次数：
269
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le...
分类：
其他好文 时间：
2014-09-13 20:08:35
阅读次数：
179
Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].No...
分类：
其他好文 时间：
2014-09-13 20:07:55
阅读次数：
287
Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].Not...
分类：
其他好文 时间：
2014-09-13 20:06:25
阅读次数：
173
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 two lists. 1 /** 2 ...
分类：
其他好文 时间：
2014-09-13 20:03:15
阅读次数：
228
Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note...
分类：
其他好文 时间：
2014-09-13 20:01:35
阅读次数：
185
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类：
其他好文 时间：
2014-09-13 20:00:35
阅读次数：
207
【题目】
Clone an undirected graph. Each node in the graph contains a label and
a list of its neighbors.
OJ's undirected graph serialization:
Nodes are labeled uniquely.
We use # as a separa...
分类：
其他好文 时间：
2014-09-11 22:29:02
阅读次数：
223
Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree{3,9,2...
分类：
其他好文 时间：
2014-09-09 11:32:38
阅读次数：
240
