1、
??
Recover Binary Search Tree
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...
分类：
其他好文 时间：
2014-06-20 10:13:49
阅读次数：
243
【题目】
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
For example:
Given binary tree {3,9,20,#,#,15,7},
3
/ 9 20
/ 15 7
return its b...
分类：
其他好文 时间：
2014-06-20 09:42:30
阅读次数：
224
原题地址：https://oj.leetcode.com/problems/merge-k-sorted-lists/题意：Mergeksorted
linked lists and return it as one sorted list. Analyze and describe its com...
分类：
编程语言 时间：
2014-06-11 21:57:07
阅读次数：
399
Liskov Substitution Princple, LSPFor every
object "o1" from type "t1", there is object "o2" from type "t2", when all "o2"
is replaced with "o1" in pro...
分类：
其他好文 时间：
2014-06-11 08:52:44
阅读次数：
221
链接： http://acm.hrbust.edu.cn/index.php?m=ProblemSet&a=showProblem&problem_id=1752
Description
There are n webpages, each of which has its respective page rank. The content is constantly updated ...
分类：
其他好文 时间：
2014-06-09 23:32:22
阅读次数：
270
题目
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. Cou...
分类：
其他好文 时间：
2014-06-08 15:32:45
阅读次数：
245
题目链接 Given a m x n grid filled with non-negative
numbers, find a path from top left to bottom right which minimizes the sum of
all numbers along its p...
分类：
其他好文 时间：
2014-06-07 21:59:08
阅读次数：
344
Given amxngrid filled with non-negative
numbers, find a path from top left to bottom right whichminimizesthe sum of all
numbers along its path.Note:Yo...
分类：
其他好文 时间：
2014-06-07 20:22:17
阅读次数：
264
Given a linked list, remove thenthnode from the
end of list and return its head.For example, Given linked list:
1->2->3->4->5, and n = 2. After re...
分类：
其他好文 时间：
2014-06-07 16:54:26
阅读次数：
221
【题目】
Given a binary tree
struct TreeLinkNode {
TreeLinkNode *left;
TreeLinkNode *right;
TreeLinkNode *next;
}
Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be...
分类：
其他好文 时间：
2014-06-07 14:28:36
阅读次数：
215
