摘要：
Total Accepted:82026Total Submissions:379898Difficulty:MediumGiven a stringS, find the longest palindromic substring inS. You may assume that the maxi... 阅读全文
posted @ 2015-12-07 22:04
zengzy
阅读(155)
评论(0)
推荐(0)
摘要：
一.两个难点算法1.Manacher算法，线性时间求最长回文子串2.KMP算法，字符串匹配问题，c语言中的strStr二.几个题目1.最长回文子串方法：暴力，动态规划，中心扩展，manacher参考：http://blog.163.com/zhaohai_1988/blog/static/20951... 阅读全文
posted @ 2015-12-07 21:14
zengzy
阅读(313)
评论(0)
推荐(0)
摘要：
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.Subscribeto see which comp... 阅读全文
posted @ 2015-12-07 19:59
zengzy
阅读(180)
评论(0)
推荐(0)
摘要：
32. Longest Valid ParenthesesGiven a string containing just the characters'('and')', find the length of the longest valid (well-formed) parentheses su... 阅读全文
posted @ 2015-12-07 19:31
zengzy
阅读(138)
评论(0)
推荐(0)
摘要：
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters fo... 阅读全文
posted @ 2015-12-07 18:07
zengzy
阅读(145)
评论(0)
推荐(0)
浙公网安备 33010602011771号