搜索资源列表
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
HuiWen
- java用字符串比较的方法来判断输入的一条字符串是否是回文-java string comparison method to determine the character input is not a palindrome
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.
0base-agorithm(2)
- 零基础C++算法编程1，包括回文数、递归算阶乘、哥德巴赫猜想等简单算法的代码-Zero-based C++ programming algorithm 1, including palindrome, recursive factorial operator, Goldbach conjecture and other simple algorithm code
Determination-of-palindrome
- 从键盘输入一个1至99999之间的数，通过该程序可以告诉你，输入的数是不是回文数-Enter a number between 1-99999 the keyboard, through the program can tell you that the number entered is not a palindrome
Palindrome-judgment
- 回文判断的C++程序，迭代实现，很有参考价值-Palindrome judge C++ program, iterative implementation, a good reference value
Palindromes
- 求1-20000之间的平方回文数 回文数也叫对称数，是指这类数的各位数字具有对称性，例如12121，通常，可以通过使用任何一个数字与其倒序数相加，再依次执行下去获得，例如：96+69 165，165+561 726，726+627 1353，1353+3531 4884。但是也有某些数字目前为止还不能验证是否可以通过上述操作获得回文数，例如数字196。平方回文数是指这类数字即是回文数，又是某个自然数的平方数，例如121，就是11的平方数，同时也是回文数。可以编写程序，通过遍历获得平方回文数
huiwenchuan
- 判断是否为回文串，可重复输入，对话窗口界面显示-TO judge whether it is huiwen string
Manacher_Longest_Subsequence
- 求一个字符串的最长回文子串的长度。比如字符串 abaaba 的最长回文子串的长度就是6.-Seeking a string longest palindromic substring length. For example, the string " abaaba" longest palindromic substring length is 6.
huiwenzifu
- 利用c语言进行回文字符的判断，并给出了详细的注释。-Using c language palindrome characters to judge, and gives a detailed note.
xunzhaohuiwenshu
- c语言课程设计，寻找回文数程序，包含了文件的读写操作-c language curriculum design, look for palindrome programs, including the operation of reading and writing files
stack
- 数据结构栈的演示程序，包括表达式求值，汉诺塔问题，回文判断、走迷宫问题等程序。- The stack data structure demo program, including expression uation, Hanoi problem, and take the program palindrome judgment maze problem etc..