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 ...
分类:
其他好文 时间:
2016-03-28 11:56:00
阅读次数:
143
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo ...
分类:
其他好文 时间:
2016-03-28 10:32:52
阅读次数:
119
题目:Write a function to find the longest common prefix string amongst an array of strings. 题解:给出的函数为:char* longestCommonPrefix(char** strs, int strsSiz ...
分类:
其他好文 时间:
2016-03-27 18:00:29
阅读次数:
256
题目: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 lon ...
分类:
编程语言 时间:
2016-03-27 01:15:39
阅读次数:
253
Given an unsorted array of integers, find the length of the longest consecutive elements sequence. Clarification Your algorithm should run in O(n) com ...
分类:
其他好文 时间:
2016-03-26 10:34:48
阅读次数:
127
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 long ...
分类:
其他好文 时间:
2016-03-24 20:04:21
阅读次数:
241
LCS(最长公共子串 longest common subsequence)一般都会采用动态规划的算法来实现,算法的时间复杂度大概是O(x2), 另外需要一个x2的额外空间, 这个算法这里我不做说明,给个讲得不错的教程地址 LCS教程 这边博文里我将给出一个不采用动态规划的算法,并且时间复杂度和动态
分类:
编程语言 时间:
2016-03-23 06:04:46
阅读次数:
279
1、 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 farthes
分类:
其他好文 时间:
2016-03-22 19:06:39
阅读次数:
114
1、 Given a dictionary, find all of the longest words in the dictionary. Given the longest words are(is) ["internationalization"]. 2、 思路: 1、得到数组里面最长的字符
分类:
其他好文 时间:
2016-03-21 18:22:08
阅读次数:
174