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-07-14 09:48:50
阅读次数:
130
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo...
分类:
其他好文 时间:
2015-07-13 22:01:03
阅读次数:
106
leetcode longest-common-prefix
求出string中的最小长度
然后依次每个string从第一个开始进行比较...
分类:
其他好文 时间:
2015-07-13 12:20:32
阅读次数:
109
Longest Consecutive Sequence
首先补充一些map的用法begin,end,rbegin,rend,empty,clear,size,max_size 八个常用的函数.map.begin(); 是map的起始位置map.end(); 是指map的尾部,没有实际元素.map.find(); 查找函数map.rebgin()和.rend()是反向遍历数据的起始位置和终止位置...
分类:
其他好文 时间:
2015-07-13 12:06:26
阅读次数:
100
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3. For “...
分类:
其他好文 时间:
2015-07-13 00:51:06
阅读次数:
112
Use the strs[0] as the reference string and then compare it with the remaining strings from left to right. Once we find a string with length less than...
分类:
其他好文 时间:
2015-07-12 15:26:17
阅读次数:
93
题目:
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 is...
分类:
编程语言 时间:
2015-07-12 12:55:23
阅读次数:
140
hdu 1231, maximum consecutive sum of integers, finding the boundaries, possibly all negative, C++...
分类:
编程语言 时间:
2015-07-12 09:38:28
阅读次数:
137
题目链接:http://poj.org/problem?id=2739#include #include using namespace std;int method[10001][1300];int dp[10001];bool isntprime[10001];int heap[1300],cn...
分类:
其他好文 时间:
2015-07-12 06:54:15
阅读次数:
108
Problem:Write a function to find the longest common prefix string amongst an array of strings.Solution:题意要求求取字符串数组的最长公共前缀子串。从位置0开始,对每一个位置比较所有的字符串,直到遇到...
分类:
其他好文 时间:
2015-07-11 20:09:04
阅读次数:
134