Given a binary tree, return the postorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
1
2
/
3
return [3,2,1].
Note: Recursive solut...
分类:
其他好文 时间:
2014-06-15 19:06:52
阅读次数:
166
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 path.
Note: You can only move either down or right at...
分类:
其他好文 时间:
2014-06-13 20:36:56
阅读次数:
280
Swap Nodes in Pairs:Given a linked list, swap every
two adjacent nodes and return its head.For example,Given1->2->3->4, you
should return the list as2...
分类:
其他好文 时间:
2014-06-13 17:04:27
阅读次数:
180
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-06-12 18:32:00
阅读次数:
222
原题地址:https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/题意:Given
a binary tree, find its maximum depth.The maximum depth is the number of n...
分类:
编程语言 时间:
2014-06-12 13:55:34
阅读次数:
210
Question: Mergeksorted linked lists and return
it as one sorted list. Analyze and describe its complexity.Solution: Find the
smallest list-head first....
分类:
其他好文 时间:
2014-06-10 19:51:30
阅读次数:
278
Given a binary tree, check whether it is a
mirror of itself (ie, symmetric around its center).For example, this binary tree
is symmetric: 1 / \ ...
分类:
其他好文 时间:
2014-06-10 11:51:42
阅读次数:
213
新项目准备上HBase。HBase目前由组里某牛负责。本着学会使用HBase的目标,先阅读下HBase in Action,学习内容包括HBase基本实现原理,使用方法,Schema设计原则和实战等。借用Michael Stack(HBase Chair)的话,“At a highlevel, HBase is like theatomic bomb.
Its basic operation...
分类:
其他好文 时间:
2014-06-10 06:33:37
阅读次数:
328