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-08 07:52:00
阅读次数：
91
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类：
其他好文 时间：
2015-04-08 00:54:17
阅读次数：
113
题意：给一字符串，求一个子串的长度，该子串满足所有字符都不重复。字符可能包含标点之类的，不仅仅是字母。按ASCII码算，就有2^8=128个。思路：从左到右扫每个字符，判断该字符距离上一次出现的距离是多少，若大于max，则更新max。若小于，则不更新。每扫到一个字符就需要更新他的出现位置了。这里边还...
分类：
其他好文 时间：
2015-04-07 23:16:50
阅读次数：
153
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类：
其他好文 时间：
2015-04-07 21:31:44
阅读次数：
120
Binary Tree Right Side View
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....
分类：
其他好文 时间：
2015-04-07 10:00:09
阅读次数：
139
【题目】
Given a string containing just the characters '(' and ')',
find the length of the longest valid (well-formed) parentheses substring.
For "(()", the longest valid parentheses substring i...
分类：
其他好文 时间：
2015-04-06 20:21:52
阅读次数：
113
题目：leetcode
Longest Consecutive Sequence
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
For example,
Given [100, 4, 200, 1, 3, 2]...
分类：
其他好文 时间：
2015-04-06 17:22:41
阅读次数：
160
Binary Tree Right Side View
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 t...
分类：
其他好文 时间：
2015-04-06 17:17:22
阅读次数：
109
题目：
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-06 15:43:56
阅读次数：
146
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-06 14:17:43
阅读次数：
104
