搜索资源列表
palindrome
- c语言基础,判断一个字符串是否为回文的程序,仅供参考-Determine whether a string is a palindrome
401-(2)
- UVA 401 这题回文题还是比较经典的。最近面试总有这类题。希望代码中的思路对你有帮助。-UVA 401 palindromic title this question is quite classic. Recent interviews always have such practice. I hope the idea of code to help you.
Huiwen
- 回文判断C++,小程序 回文判断C++,小程序-cycle C++
jishiben
- 用java实现的简单记事本,提供新建,保存,另存为,字体,颜色等功能,提供回文数,数字引文互译,统计单词数,文本求和等功能-Using java to achieve a simple notepad, offers New, Save, Save As, fonts, colors and other features, provides palindrome, digital citations translation, statistical number of words, text s
Palindrome-Number
- 判断一个数是否是回文数。一种比较简单易懂的好的方法。-Palindrome Number
huiwenshu
- 判断输入的数字是否是回文数,回文数:121、12321等从左到右和从右到左是一样的-Enter the number to judge whether the palindrome palindrome: 121,12321 other from left to right and from right to left is the same
Judge-palindromic-sequence
- 制作简易的菜单,运用递归调用,实现判断回文数的功能-Create a simple menu using a recursive call to realize the function of judge palindrome
B
- 定义一个字符栈类CStack。私有数据成员:栈数组和指向栈顶的下标或指针;公有成员函数:构造函数、拷贝构造函数、压栈、出栈、清栈、访问栈顶元素、检测栈是否空,是否满等。用上述栈来做回文游戏。用户输入一行字符判断是否为回文。(回文:顺读和逆读字符串一样(不包括空格);如:“a man a plan a canal panama”,就是回文)。注意过滤掉空格。-Defines a character class stack CStack.
a-palindrome
- 判断一串字符是否为回文,即该字符段无论是正过来还是反过来是否都一样-Judge a string of letters is a palindrome, The character segment either coming or vice versa are identical
4.4.1
- 判定给定字符向量是否为回文(从左向右读和从右向左读相同的字符序列)。-Determine whether a given character vector palindrome (reading from left to right and right to left reading the same sequence of characters).
MaxBackTraceSubString
- 最长回文子串的Java实现 经典算法习题之一 可以输出一串字符中最长的重复子串-Java longest palindrome substring exercises to achieve one of the classic algorithm can output a string of characters in the longest repeated substring
pro9
- 如果一个数从左往右读和从右往左读都是一样,那么这个数就叫做“回文数”。例如,12321就是一个回文数,而77778就不是。当然,回文数的首和尾都应是非零的,因此0220就不是回文数。 事实上,有一些数(如21),在十进制时不是回文数,但在其它进制(如二进制时为10101)时就是回文数。 编一个程序,从文件读入两个十进制数N (1 <= N <= 15)S (0 < S < 10000)然后找出前N个满足大于S且在两种或两种以上进制(二进制至十进制)上是回文数的十进
main
- 消除形如AA ABA的回文串。可以消除一串字符中所有的回文串-Eliminate shaped like AA ABA palindrome string. You can eliminate all of the palindrome string of characters in a string
huiwen
- 回文串的实现,适合初学java的人使用和阅读-Palindrome string implementations, suitable for beginners java people use and read
longestPalindrome
- 求最长回文子串 第一种解法:动态规划(内存分配较多,且时间复杂度为O(n^2))第2种解法:Manacher算法-Find the longest palindrome substring First Solution: Dynamic Programming (memory allocation more, and the time complexity is O (n ^ 2)) The second solution: Manacher algorithm
Judgment_palindrome
- 编写一个函数palin()用来检查一个字符串是否正向拼写与反向拼写都一样的“回文”(palindromia)。如“MADAM”就是一个回文。若放宽要求,即忽略大小写字母的区别、忽略空格及标点符号等,则像“Madam,I m Adam.”之类的短语也可视为回文。编程要求:⑴在主函数中输入字符串。⑵将字符串首指针作为函数参数传递到函数palin()中。当字符串是回文时,要求函数palin()返回1,否则返回0。⑶若是回文,在主函数中输出"Yes.";若不是回文,在主函数中输出"No."。 提示:
back
- 回文分析C程序:可判断字符串内存储的是否为回文,可判断中英混合字符串。 回文样例:上海自来水来自海上。 ABCBA A我B市B我A-Palindrome analysis C program: to determine whether the string is stored as a palindrome, the judgment of mixed strings. Palindrome Example: Shanghai water from the sea. ABCBA
palindrome
- 回文在Visual2010编译环境下的实现方法。-palindrome on visual2010
stack
- 数据结构课后作业-栈 对输入文字进行回文验证.-Data structure after-school homework- stack Validation of the input text are palindromes.
zhishu
- 利用C语言判断并输出1亿以内回文式质数,并且计算所用时间-Using C language to determine and output within 100 million palindromic primes formula and calculate the time spent