【题目】
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
For example:
Given the following binary tre...
分类：
其他好文 时间：
2015-04-06 11:32:47
阅读次数：
173
Given a binary tree, imagine yourself standing on therightside of it, return the values of the nodes you can see ordered from top to bottom.For exampl...
分类：
其他好文 时间：
2015-04-06 06:27:07
阅读次数：
103
Pre x goodness of a set string is length of longest common pre x*number of strings in the set. For
example the pre x goodness of the set f000,001,0011g is 6.You are given a set of binary strings. Fin...
分类：
其他好文 时间：
2015-04-06 01:07:22
阅读次数：
178
题目Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.For example:
Given the following binary tree,
1...
分类：
其他好文 时间：
2015-04-05 22:00:55
阅读次数：
201
今天清明，再补一篇Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating l...
分类：
其他好文 时间：
2015-04-05 21:54:11
阅读次数：
134
https://leetcode.com/problems/longest-valid-parentheses/Given a string containing just the characters'('and')', find the length of the longest valid (...
分类：
其他好文 时间：
2015-04-05 21:38:33
阅读次数：
136
一：Integer to Roman
题目：
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
链接：https://leetcode.com/problems/integer-to-roman/
分析：此题...
分类：
其他好文 时间：
2015-04-05 16:02:09
阅读次数：
156
原题：
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
For example:
Given the following binary tree...
分类：
其他好文 时间：
2015-04-05 09:06:21
阅读次数：
113
Given a binary tree, imagine yourself standing on therightside of it, return the values of the nodes you can see ordered from top to bottom.For exampl...
分类：
其他好文 时间：
2015-04-05 01:12:03
阅读次数：
193
