class Solution {public: int longestConsecutive(vector &num) { int len = num.size(); int max_cons = 0; int cur_cons = 0...
分类：
其他好文 时间：
2014-06-30 14:19:28
阅读次数：
159
Maximum Depth of Binary TreeGiven a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root ...
分类：
其他好文 时间：
2014-06-27 23:13:24
阅读次数：
218
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类：
其他好文 时间：
2014-06-27 12:48:10
阅读次数：
238
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longes...
分类：
其他好文 时间：
2014-06-27 12:46:45
阅读次数：
238
Write a function to find the longest common prefix string amongst an array of strings.public class Solution { public String longestCommonPrefix(Str...
分类：
其他好文 时间：
2014-06-25 17:03:03
阅读次数：
331
Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the lon...
分类：
其他好文 时间：
2014-06-25 11:07:45
阅读次数：
230
【题目】
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
For example,
Given [100, 4, 200, 1, 3, 2],
The longest consecutive elements sequence is [1, 2, 3, 4]. Return its length: 4.
Your algorithm should run...
分类：
其他好文 时间：
2014-06-25 07:55:42
阅读次数：
244
后缀自动机裸题....
Longest Common Substring
Time Limit: 2000MS
Memory Limit: Unknown
64bit IO Format: %lld & %llu
[Submit]
[Go Back] [Status]
Description
A st...
分类：
其他好文 时间：
2014-06-24 22:15:40
阅读次数：
240
题目
Given a string S,
find the longest palindromic substring in S.
You may assume that the maximum length of S is
1000, and there exists one unique longest palindromic substring.
方法
...
分类：
其他好文 时间：
2014-06-24 19:36:55
阅读次数：
212
Longest Palindromic Substring：Given a stringS, find the longest palindromic substring inS.You may assume that the maximum length ofSis 1000, and there...
分类：
其他好文 时间：
2014-06-21 07:36:18
阅读次数：
227
