Palindromic 第20页

leetcode Longest Palindromic Substring

题目GivenastringS,findthelongestpalindromicsubstringinS.YoumayassumethatthemaximumlengthofSis1000,andthereexistsoneuniquelongestpalindromicsubstring.题目来源：https://leetcode.com/problems/longest-palindromi

u010902721·2015-05-27 11:00

Longest Palindromic Substring-Dynamic Programing

LongestPalindromicSubstringGivenastringS,findthelongestpalindromicsubstringinS.Analysis:Firstthinkhowwecanavoidunnecessaryre-computationinvalidatingpalindromes.Considerthecase"ababa".Ifwealreadyknewth

lxw0109·2015-05-20 09:00

Leetcode#5Longest Palindromic Substring

LongestPalindromicSubstring TotalAccepted: 49558 TotalSubmissions: 238911MySubmissionsQuestion Solution Givenastring S,findthelongestpalindromicsubstringin S.Youmayassumethatthemaximumlengthof S is100

谧晦·2015-05-19 17:37

Longest Palindromic Substring

Given a string S, find the longest palindromic substring in S.

hcx2013·2015-05-18 22:00

LeetCode(Longest Palindromic Substring)

Manacher算法，时间复杂度为O(n)。预处理：原串s：aaaba转换后得到的串t：#a#a#a#b#a#引入辅助数组vec，vec[i]表示以t[i]为中心的最长回文串的半径：t：#a#a#a#b#a#vec：12343214121vec的性质：vec[i]-1=以t[i]为中心的最长回文串在原串s中的长度。证：在最长回文串中，#的个数=原串s的字符的个数+1。vec的计算：显然vec[0]

hz5034·2015-05-14 18:00

LeetCode 5:Longest Palindromic Substring

Givenastring S,findthelongestpalindromicsubstringin S.Youmayassumethatthemaximumlengthof S is1000,andthereexistsoneuniquelongestpalindromicsubstring.分析：采用中心扩展法，每个字符都有可能是回文字符串的中点。依次求得各字符作为中心的回文字符串，取其中最

sunao2002002·2015-05-12 00:00

最长连续回文串(Longest Palindromic Substring)算法探究

Manacher算法，算法复杂度为O(n)，网上介绍也比较多，这里就不再赘述，给出该算法的源地址吧：链接地址：http://articles.leetcode.com/2011/11/longest-palindromic-substring-part-ii.html

zf19921020·2015-05-08 10:00

leetcode--Longest Palindromic Substring

GivenastringS,findthelongestpalindromicsubstringinS.YoumayassumethatthemaximumlengthofSis1000,andthereexistsoneuniquelongestpalindromicsubstring.publicclassSolution{ publicStringlongestPalindrome(Stri

kangaroo835127729·2015-05-03 08:00

[LeetCode] Longest Palindromic Substring 最长回文串

Given a string S, find the longest palindromic substring in S.

·2015-04-29 00:00

判断一个字符串是否为回文数字符串

#include #defineSTRLEN100 intIs_palindromic_str(char*str) { intleft=0;//字符串数组的第一个字母的下标 inti=0; while

ZongYinHu·2015-04-26 19:00

July 算法习题 - 字符串 3 + Leetcode - Add Binary,Palindromic Substring

虽是读书笔记，但是如转载请注明出处http://segmentfault.com/blog/exploring/..拒绝伸手复制党最长回文子串题目描述给定一个字符串，求它的最长回文子串的长度。alsoLeetcode5GivenastringS,findthelongestpalindromicsubstringinS.YoumayassumethatthemaximumlengthofSis10

SecondLife·2015-04-26 00:00

[LeetCode] Longest Palindromic Substring

LongestPalindromicSubstringGivenastring S,findthelongestpalindromicsubstringin S.Youmayassumethatthemaximumlengthof S is1000,andthereexistsoneuniquelongestpalindromicsubstring.解题思路：1、动态规划，找回文。用二维数组记录j

wangshaner1·2015-04-17 12:00

LeetCode:Longest Palindromic Substring 最长回文子串

忽然找到一位关于此题详细介绍的大牛文章。转载之，以后常回顾一下。http://www.cnblogs.com/tenosdoit/p/3675788.html表示没学过动态规划，闲下来时候研究研究。算法4挺别出心裁，值得学习！题目链接GivenastringS,findthelongestpalindromicsubstringinS.Youmayassumethatthemaximumlengt

vvaaiinn·2015-04-17 10:00

LeetCode 5 Longest Palindromic Substring

题目：Given a stringS, find the longest palindromic substring inS.

vvaaiinn·2015-04-17 10:00

5、Longest Palindromic Substring

题目如下：Givenastring S,findthelongestpalindromicsubstringin S.Youmayassumethatthemaximumlengthof S is1000,andthereexistsoneuniquelongestpalindromicsubstring.分析如下：1时间复杂度为O(N³)的算法如果一个字符串从左向右写和从右向左写是一样的，这样的

sddyljsx·2015-04-13 21:00

LeetCode - Longest Palindromic Substring

LeetCode-LongestPalindromicSubstringThsproblemisdescribedasfollowing:GivenastringS,findthelongestpalindromicsubstringinS.YoumayassumethatthemaximumlengthofSis1000,andthereexistsoneuniquelongestpalindr

zhangyalin1992·2015-04-12 17:00

UVA 11027 Palindromic Permutation（组合数学）

题意：给出字符串，以及n，然后字符串中的字母排序可以组成若干的字符串，有些为回文串，输出第n个回文串，若不存在第n个回文串，输出“XXX”。解析：因为n非常大，所以用枚举是由点不太现实的，对于一个字符串，若能重排成回文串，说明每个字母出现的次数都为偶数，或者说为奇数的只有一个（可以放在中间）；然后这样我们就可以将字符缩减一半，构造左半边的字符串（注意若有单个字符输出时要加上）。然后根据左边的回文串

HelloWorld10086·2015-04-06 19:00

Codeforces Gym 100543G Virus synthesis (Palindromic Tree + DP) 2014欧洲中部赛区G题

题目大意：就是现在初始的时候没有任何DNA链，现在又无数个A,G,C,T这些材料无数个,每次可以在已经有的链上选择2中操作：1.在链的的左边或者右边加上A,G,C,T的其中一个2.将现有的链镜像相连如AGC镜像可以变成AGCCGA或CGAAGC给出一个长度不超过10^5的目标串,问最少需要几次操作完成这样一条链,其实的链为空大致思路：这个题挺难的,想了好久才想明白首先注意到对于目标串,最优的构造策

u013738743·2015-04-01 15:00

Codeforces Gym 100548G The Problem to Slow Down You (Palindromic Tree 或 Hash水过) 2014西安现场赛G题

题目大意：就是现在给你两个长度不超过20W的字符串,都只包含小写字母,求相同的回文串对数(S,T),其中S==T,S来自第一个字符串,T来自第二个字符串,S和T都是回文串大致思路：首先很容易想到的是Manacher+后缀数组二分+Hash的做法，复杂度O(nlogn)，可惜的是这个题目Hash容易被卡试了好几次Hash之后试了一发二次Hash居然神奇地过了==...不过这题用Hash还是太靠RP了

u013738743·2015-03-31 18:00

HDU 5157 Harry and magic string (BestCoder Round #25 D) Manacher(或 Palindromic Tree) + 前缀和

题目大意：就是现在给出一个字符串s,长度不超过10^5,然后求出其中不相交的回文字串的对数大致思路：其实一眼看去就知道可以用Manacher处理出回文半径之后用前缀和解决不过有想了一下PalindromicTree的做法,算是练习一下PalindromicTree了解法一：Manacher处理出所有位置的回文半径然后计算以i位置结尾的回文串数量和以i位置开始的回文串数量,然后其中一组乘上另外一组的

u013738743·2015-03-31 10:00

SPOJ NUMOFPAL - Number of Palindromes 水题 (Palindromic Tree 练习)

题目大意：其实就是一个字符串求出其好友的回文串的数量(本质相同但位置不同视为相同)大致思路：其实就是一个水题,给出的字符串长度 #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #

u013738743·2015-03-30 22:00

URAL 2040 Palindromes and Super Abilities 2 (Palindromic Tree)

题目大意：对于输入的字符串s(长度不超过5000000,只包含a,b两种字符)如果这个字符串从左到右依次加入形成的s,当每个字符加入时求新增加的本质不同的回文串的数量大致思路：和URAL1940 PalindromesandSuperAbilities一样就是简单的PalindromicTree的应用,就是时间有些紧,所以读入和输出需要一些优化代码如下：Result : Accepted Mem

u013738743·2015-03-30 21:00

URAL 1960 Palindromes and Super Abilities (Palindromic Tree)

题目大意：就是对于给出的字符串s(长度不超过10^5),求出其各个前缀含有的不同回文串的数量大致思路：其实就是PalindromicTree的裸题...看懂了PalindromicTree的结构之后这个简直不能再明显,当做联系PalindromicTree来做了,代码如下：Result : Accepted Memory : 12222KB Time : 187ms/* *Author:Gat

u013738743·2015-03-30 21:00

HDU 4426 (ZOJ 3661) Palindromic Substring 后缀数组二分 + Manacher + Hash

题目大意：就是现在对于T(T #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include usingnamespacestd; cons

u013738743·2015-03-27 09:00

[ONTAK2010]回文等价Palindromic E…

题目：翻译后题目见：http://cojs.tk/cogs/problem/problem.php?pid=1821原题见：http://main.edu.pl/en/archive/ontak/2010/palWewillcalltwowords and oflength palindromicallyequivalent,ifforeverypairofnumbers and suc

wmdcstdio·2015-03-24 19:00

TOJ 3153 Recursively Palindromic Partitions

题意求一个数的回文递归分解的个数，比如说数字7：71+5+12+3+2------1+1+3+1+13+1+3------1+1+1+1+1+1+1一共有6种分解的方法。思路题意就已经明了，思路按照上面的分解也就差不多了对于一个数分解的时候：只要保持左右相等，就是一种分解方法；可以递推来解决:f[0]=f[1]=1f[7]=f[0]+f[1]+f[2]+f[3]即可代码#include using

u013652219·2015-03-04 11:00

Palindromic Number (25)

AnumberthatwillbethesamewhenitiswrittenforwardsorbackwardsisknownasaPalindromicNumber.Forexample,1234321isapalindromicnumber.Allsingledigitnumbersarepalindromicnumbers.Non-palindromicnumberscanbepaire

oFengWuYu1·2015-03-02 17:00

Longest Palindromic Substring (Medium) (C++/Java/Python)

索引：[LeetCode]Leetcode题解索引(C++/Java/Python/Sql)Github:https://github.com/illuz/leetcode005.Longest_Palindromic_Substring

hcbbt·2015-02-28 00:00

General Palindromic Number (20)

AnumberthatwillbethesamewhenitiswrittenforwardsorbackwardsisknownasaPalindromicNumber.Forexample,1234321isapalindromicnumber.Allsingledigitnumbersarepalindromicnumbers.Althoughpalindromicnumbersaremos

oFengWuYu1·2015-02-25 20:00

PAT A1019 General Palindromic Number

//ac了，自己做的，但是注意末尾无空格的处理只有一行参考了书。另外输出那里可以更简洁，因为注意到无论是还是不是，都要输出进制形式的 //break是跳出最内层的循环（while,for）或switch,if什么的跟他无关 //大概题意：一个十进制，按照指定进制转换后的形式是否是回文数 /*是啊,break用于循环语句或分支选择,作用是跳出或者终止循环,例如 main() { inti,sum=0

daisyleedq·2015-02-22 22:00

Longest Palindromic Substring

Given a string S, find the longest palindromic substring in S.

plan454·2015-02-12 22:00

LeetCode 题解（67）: Longest Palindromic Substring

题目：GivenastringS,findthelongestpalindromicsubstringinS.YoumayassumethatthemaximumlengthofSis1000,andthereexistsoneuniquelongestpalindromicsubstring.题解：首先学习了一下LeetCode讨论区里的DP解法，空间复杂度O(n^2)，MemoryLimitE

u011029779·2015-02-08 14:00

LeetCode 5.Longest Palindromic Substring

题目:Givenastring S,findthelongestpalindromicsubstringin S.Youmayassumethatthemaximumlengthof S is1000,andthereexistsoneuniquelongestpalindromicsubstring.分析与解答：求字符串S的最长回文子串。暴力法的时间复杂度为O(n^3)，不予考虑。方法1.计算以

caishenfans·2015-02-01 23:00

poj 1221 dp(UNIMODAL PALINDROMIC DECOMPOSITIONS)

题意：给出一个数n，把它拆分成若干个数的和，要求这些数为UNIMODALPALINDROMIC的形式（见原题描述）。最大的数在中间并向两边非递增。问拆法有多少种。思路：dp。dp[i][j]表示分解数i且分解后的序列中第一个数（显然最后一个数也是）是j的分解个数。dp[i][0]中存放整数i的分解方法个数。其中dp数组j只需考虑从0到i/3即可，因为如果第一个数和最后一个数大于i/3，那么这两个数

dumeichen·2015-01-31 17:00

Palindromic Number (25)

题目：AnumberthatwillbethesamewhenitiswrittenforwardsorbackwardsisknownasaPalindromicNumber.Forexample,1234321isapalindromicnumber.Allsingledigitnumbersarepalindromicnumbers.Non-palindromicnumberscanbepa

Yangsongtao1991·2015-01-30 22:00

General Palindromic Number (20)

题目：AnumberthatwillbethesamewhenitiswrittenforwardsorbackwardsisknownasaPalindromicNumber.Forexample,1234321isapalindromicnumber.Allsingledigitnumbersarepalindromicnumbers.Althoughpalindromicnumbersare

Yangsongtao1991·2015-01-30 22:00

Longest Palindromic Substring

题目链接：LongestPalindromicSubstringGivenastringS,findthelongestpalindromicsubstringinS.YoumayassumethatthemaximumlengthofSis1000,andthereexistsoneuniquelongestpalindromicsubstring.这道题的要求是在字符串中找出最长回文子串。假设

makuiyu·2015-01-27 22:00

leetcode_5_Longest Palindromic Substring

描述：Givenastring S,findthelongestpalindromicsubstringin S.Youmayassumethatthemaximumlengthof S is1000,andthereexistsoneuniquelongestpalindromicsubstring.思路：刚开始非常天真，以为stringBuilder.reverse()和stingBuilde

dfb198998·2015-01-27 20:00

leetcode-----------Longest Palindromic Substring

题目：Givenastring S,findthelongestpalindromicsubstringin S.Youmayassumethatthemaximumlengthof S is1000,andthereexistsoneuniquelongestpalindromicsubstring.下面是英文，祝你好运GivenastringS,findthelongestpalindromi

chenxun2009·2015-01-27 14:00

5.Longest Palindromic Substring Leetcode Python

GivenastringS,findthelongestpalindromicsubstringinS.YoumayassumethatthemaximumlengthofSis1000,andthereexistsoneuniquelongestpalindromicsubstring.这题有两种解法，第一种是一一把所有序列挑出来比较他们是否是palidronme然后挑出最长的。这种解法是O(n

hyperbolechi·2015-01-27 12:00

[LeetCode] Longest Palindromic Substring 解题报告

Givenastring S,findthelongestpalindromicsubstringin S.Youmayassumethatthemaximumlengthof S is1000,andthereexistsoneuniquelongestpalindromicsubstring.»Solvethisproblem[解题思路]O(n*n)。对于每一个字符，以之作为中间元素往左右寻找

lcj_cjfykx·2015-01-24 00:00

[C++]LeetCode: 99 Longest Palindromic Substring (最长回文子串)

题目：GivenastringS,findthelongestpalindromicsubstringinS.YoumayassumethatthemaximumlengthofSis1000,andthereexistsoneuniquelongestpalindromicsubstring.思路：题目要求的s的一个最长回文子串。暴力解决办法就是枚举所有的子串，再对每个子串进行回文判断。进行剪枝

Cindy_niu·2015-01-15 21:03

[C++]LeetCode: 99 Longest Palindromic Substring (最长回文子串)

题目：Givenastring S,findthelongestpalindromicsubstringin S.Youmayassumethatthemaximumlengthof S is1000,andthereexistsoneuniquelongestpalindromicsubstring.思路：题目要求的s的一个最长回文子串。暴力解决办法就是枚举所有的子串，再对每个子串进行回文判断。

cinderella_niu·2015-01-15 21:00

good-article.3--------Longest Palindromic Substring Part II

GivenastringS,findthelongestpalindromicsubstringinS.Note:ThisisPartIIofthearticle: LongestPalindromicSubstring.Here,wedescribeanalgorithm(Manacher’salgorithm)whichfindsthelongestpalindromicsubstringin

chenxun2009·2015-01-14 14:00

good-article.2--------Longest Palindromic Substring Part I

ThisinterestingproblemhasbeenfeaturedinthefamousGreplinprogrammingchallenge,andisaskedquiteoftenintheinterviews.Why?Becausethisproblemcanbeattackedinsomanyways.TherearefivedifferentsolutionsthatIamawa

后打开撒打发了·2015-01-14 14:30

good-article.2--------Longest Palindromic Substring Part I

Thisinterestingproblemhasbeenfeaturedinthefamous Greplinprogrammingchallenge,andisaskedquiteoftenintheinterviews.Why?Becausethisproblemcanbeattackedinsomanyways.TherearefivedifferentsolutionsthatIamaw

chenxun2009·2015-01-14 14:00

[Leetcode] 5 - Longest Palindromic Substring

题目链接：https://oj.leetcode.com/problems/longest-palindromic-substring/这道题通常可以写出来的是2种做法。

leo524891010·2015-01-07 14:00

【HDU】5157 Harry and magic string 【Palindromic Tree】

传送门：【HDU】5157Harryandmagicstring题目分析：回文树裸题。令n为字符串长度，字符串下标从0开始。从字符串最后一个字符开始插入回文树构造回文树，记录以下标i~n-1为起点的回文串的个数的sum[i]。然后再正着构造一次回文树，边构造边累加答案，设x为以下标i的字符为结尾的回文串个数，则ans+=x*sum[i+1]。最后输出ans即可。PS：如果想了解回文树，可以戳这里：

u013368721·2015-01-03 22:00

[LeetCode]5 Longest Palindromic Substring

https://oj.leetcode.com/problems/longest-palindromic-substring/http://fisherlei.blogspot.com/2012/12/

furuijie8679·2015-01-02 12:53

【codeforces】2014-2015ACM-ICPC CERC 14 Problem G: Virus synthesis 【Palindromic Tree+DP】

传送门：【codeforces】2014-2015ACM-ICPCCERC14ProblemG:Virussynthesis题目分析：首先我们构造回文树，然后我们只考虑长度为偶数的回文串，长度为奇数的回文串总可以通过长度为偶数的回文串然后加上剩下的所需字符构成（当然这个偶数回文串的长度可以是0，此时这个奇数回文串的构造次数就是其长度）。对于一个偶数长度回文串u，假设其构造次数为dp[u]，由这个串

u013368721·2014-12-24 22:00

推荐频道

Palindromic

leetcode Longest Palindromic Substring

Longest Palindromic Substring-Dynamic Programing

Leetcode#5Longest Palindromic Substring

Longest Palindromic Substring

LeetCode(Longest Palindromic Substring)

LeetCode 5:Longest Palindromic Substring

最长连续回文串(Longest Palindromic Substring)算法探究

leetcode--Longest Palindromic Substring

[LeetCode] Longest Palindromic Substring 最长回文串

判断一个字符串是否为回文数字符串

July 算法习题 - 字符串 3 + Leetcode - Add Binary,Palindromic Substring

[LeetCode] Longest Palindromic Substring

LeetCode:Longest Palindromic Substring 最长回文子串

LeetCode 5 Longest Palindromic Substring

5、Longest Palindromic Substring

LeetCode - Longest Palindromic Substring

UVA 11027 Palindromic Permutation（组合数学）

Codeforces Gym 100543G Virus synthesis (Palindromic Tree + DP) 2014欧洲中部赛区G题

Codeforces Gym 100548G The Problem to Slow Down You (Palindromic Tree 或 Hash水过) 2014西安现场赛G题

HDU 5157 Harry and magic string (BestCoder Round #25 D) Manacher(或 Palindromic Tree) + 前缀和

SPOJ NUMOFPAL - Number of Palindromes 水题 (Palindromic Tree 练习)

URAL 2040 Palindromes and Super Abilities 2 (Palindromic Tree)

URAL 1960 Palindromes and Super Abilities (Palindromic Tree)

HDU 4426 (ZOJ 3661) Palindromic Substring 后缀数组二分 + Manacher + Hash

[ONTAK2010]回文等价Palindromic E…

TOJ 3153 Recursively Palindromic Partitions

Palindromic Number (25)

Longest Palindromic Substring (Medium) (C++/Java/Python)

General Palindromic Number (20)

PAT A1019 General Palindromic Number

Longest Palindromic Substring

LeetCode 题解（67）: Longest Palindromic Substring

LeetCode 5.Longest Palindromic Substring

poj 1221 dp(UNIMODAL PALINDROMIC DECOMPOSITIONS)

Palindromic Number (25)

General Palindromic Number (20)

Longest Palindromic Substring

leetcode_5_Longest Palindromic Substring

leetcode-----------Longest Palindromic Substring

5.Longest Palindromic Substring Leetcode Python

[LeetCode] Longest Palindromic Substring 解题报告

[C++]LeetCode: 99 Longest Palindromic Substring (最长回文子串)

[C++]LeetCode: 99 Longest Palindromic Substring (最长回文子串)

good-article.3--------Longest Palindromic Substring Part II

good-article.2--------Longest Palindromic Substring Part I

good-article.2--------Longest Palindromic Substring Part I

[Leetcode] 5 - Longest Palindromic Substring

【HDU】5157 Harry and magic string 【Palindromic Tree】

[LeetCode]5 Longest Palindromic Substring

【codeforces】2014-2015ACM-ICPC CERC 14 Problem G: Virus synthesis 【Palindromic Tree+DP】