搜索资源列表
Longest-Palindromic-Substring
- //动态规划求最长回文子串 //用布尔型t[i][j]表示子串（s(i....j))是否为回文子串 //其中t[i][j]的值可通过t[i+1][j-1]的值以及是s[i]和s[j]是否相等判断（即子串（s(i...j))是否为回文子串可通过子问题s（i+1,...,j-1)是否为回文串来解决） //通过left和right来指示当前最长回文子串的下标-// Dynamic programming longest palindrome substring // Boolean t
PALINDROME
- MIPS assembly，汇编实现输入一个字符串，判断其是否为回文-MIPS assembly, the compilation includes a string input to determine whether it is a palindrome
Desktop
- 字符串回文检测，三个数大小排序，等等小程序代码-String palindrome detection, three numbers in descending order, etc. applet code
5-Longest-Palindromic-Substring
- “回文串”是一个正读和反读都一样的字符串，比如“level”或者“noon”等等就是回文串。回文子串，顾名思义，即字符串中满足回文性质的子串。 Manacher算法- Palindrome string is a positive reading and verlan are the same string, such as level or noon and so is a palindrome string. Palindrome substring, by definitio
7104
- 编程找出10000以内所有的回文数的平方仍是回文数的数。所谓回文数是指左右数字完全对称的自然数，例如：11，121，1221等都是回文数。-All of the programming find within 10,000 square is still the number of reported the number of reported. So-called palindromes number refers to the specified number of symmetrical
example103
- 计算企业奖金，计算回文件数等，里面有说明！-Enterprise computing bonuses, calculated back to document the number, which has made it clear!
huiwen
- 对回文数进行管理，abccba以及abcba都是回文数。-Palindrome the management, abccba, as well as abcba palindrome.-
huiwen101
- 回文，求一个数字是否是回文，中间含有一个函数，然后可以进行判定-Palindrome, is seeking a number is palindrome in the middle contains a function, and then can be determined
huiwen1111
- 回文是指正向读和反向读都一样的一段数字或者文字,如321123或“able was I ere I saw elba”。编写程序,输入一个9位整数,并判断它是否是回文-Palindrome is a correction to the reading and reverse reading of the same period the number or text, such as 321,123, or able was I ere I saw elba . Programming, ent
Palindrome
- 回文串,可以实现回文串的判断，忽略字符串中的英文字母的大小写-Palindrome string, string palindrome can judge ignored the letters in the string case
palindrome101
- 回文判断输入一个字符串可以判断是不是回文。-Determine palindrome
palindrome102
- 回文的判断方式，c++实现，参照baidu上面的代码-Palindrome way the judge, c++ Achieve, in the light of the above code baidu
Practice1_15
- 找出回文数，就是在一定范围内找出顺读和倒读都一样的词语。-Palindrome identify a few, that is, a certain scope to identify cis and read back the words read are the same.
PalindromeJudge
- c++代码，代码功能为：判断一个字符串是否为回文串-c++ code, the code for the function: to determine whether a string is a palindrome string
math_test
- 计算任意1~L自然数中回文数字（形如：101,121,232,353的个数）的个数，输出结果存在文件Datafile中。 -CALCULATING 1 ~ L is a natural number of palindromic numbers (like this: the number of 101,121,232,353) number, the output of file Datafile in.
Shortest-Palindrome
- 给定一个字符串,你可以将它转换成一个回文通过添加字符在它前面。找到并返回最短的回文可以发现通过执行这个转换。 例如: 鉴于“aacecaaa”,返回“aaacecaaa”。 鉴于“abcd”,返回“dcbabcd”。-Given a string S, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest p
C
- 实现杨辉三角的输出，字符指针检测回文，字符数组检测回文，字符串按要求排序，哥德巴赫猜想的验证等C语言程序，亲测有效-Print Pascal s Triangle Goldbach conjecture verification The method of judging character array palindrome
Palindrome_check
- 测试输入字符是不是回文，该回文测试忽略所有空格和标点符号，并忽略字母的大写和小写形式 -Test input character is not a palindrome, the palindrome test ignores all spaces and punctuation, and ignore uppercase and lowercase letters
huiwen
- 计算年月日回文的日期 计算年月日回文的日期-cal the day is the same as reverted
LongPlind_Remove
- 寻找回文子串是一道经典的面试题，本代码旨在解决字符可删情况下的寻找最长回文子串问题。-Finding the longest palindromic substring is one of the most typical face questions, the source code uploaded is aimed to finding the longest palindromic substring while the characters are removable.