码迷,mamicode.com
首页 >  
搜索关键字:longest consecutive    ( 3017个结果)
#5 Longest Palindromic Substring
原题链接:https://leetcode.com/problems/longest-palindromic-substring/ Given a string S, find the longest palindromic substring inS. You may assume that the maximum length of S is 1000, and ther...
分类:其他好文   时间:2015-06-21 14:33:22    阅读次数:119
Longest Palindromic Substring2015年6月20日
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...
分类:其他好文   时间:2015-06-20 22:00:33    阅读次数:219
leetcode - Longest Palindromic Substring
题目: Longest Palindromic Substring   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...
分类:其他好文   时间:2015-06-20 17:07:53    阅读次数:126
Maximum Depth of Binary Tree
Description: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...
分类:其他好文   时间:2015-06-20 15:36:39    阅读次数:120
[转]O(n)回文子串算法 Manacher算法
这里,我介绍一下O(n)回文串处理的一种方法。Manacher算法.原文地址:http://zhuhongcheng.wordpress.com/2009/08/02/a-simple-linear-time-algorithm-for-finding-longest-palindrome-sub....
分类:编程语言   时间:2015-06-20 13:08:23    阅读次数:192
[LeetCode] Longest Palindromic Substring
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. 解题思路 网上有一种思路是说先得到输入字符...
分类:其他好文   时间:2015-06-19 21:39:30    阅读次数:112
[Java]LeetCode5 Longest Palindromic Substring
[Java]LeetCode5 Longest Palindromic Substring...
分类:编程语言   时间:2015-06-19 11:56:24    阅读次数:145
Dynamic Programming | Set 3 (Longest Increasing Subsequence)
在 Dynamic Programming | Set 1 (Overlapping Subproblems Property) 和 Dynamic Programming | Set 2 (Optimal Substructure Property) 中我们已经讨论了重叠子问题和最优子结构性质,现...
分类:其他好文   时间:2015-06-18 23:48:43    阅读次数:150
Dynamic Programming | Set 4 (Longest Common Subsequence)
首先来看什么是最长公共子序列:给定两个序列,找到两个序列中均存在的最长公共子序列的长度。子序列需要以相关的顺序呈现,但不必连续。例如,“abc”, “abg”, “bdf”, “aeg”, ‘”acefg”等都是“abcdefg”的子序列。因此,一个长度为n的序列拥有2^n中可能的子序列(序列中的每...
分类:其他好文   时间:2015-06-18 23:40:31    阅读次数:211
[LintCode] Longest Increasing Continuous subsequence II
Longest Increasing Continuous subsequence IIGive you an integer matrix (with row size n, column size m),find the longest increasing continuous subsequ...
分类:其他好文   时间:2015-06-18 19:21:53    阅读次数:156
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!