搜索资源列表
huiwenshu.rar
- 判断一个整数N 是不是回文数(10 进 制和2 进制都要是回文):例如1,3,5 都 满足条件。,Determine an integer number N is not a palindrome (10 M and 2 M to be the palindrome): for example, have to meet conditions 1,3,5.
palindrome
- 回文的判断方式,c++实现,参照baidu上面的代码-Palindrome way the judge, c++ Achieve, in the light of the above code baidu
_ch301.c
- 回文判断,正与反都用相同的字符序列为准.用堆栈实现-Palindrome judge, is working with the anti-all with the same sequence of characters shall prevail. To use the stack to achieve
example
- 计算企业奖金,计算回文件数等,里面有说明!-Enterprise computing bonuses, calculated back to document the number, which has made it clear!
Algorithm
- 回文数计算: 编写一个程序,输入N(2=N=16)进制数M(1=M=30000(10进制)),输出最少经过几步可以得到回文数。如果在30步以内(含30步)不可能得到回文数,则输出0。输入的数保证不为回文数。-None
Practice1_15
- 找出回文数,就是在一定范围内找出顺读和倒读都一样的词语。-Palindrome identify a few, that is, a certain scope to identify cis and read back the words read are the same.
Stack
- 完成堆栈抽象数据类型的顺序、链式表示与实现。实现功能:数值转换,计算器(表达式求值),迷宫求解,判断某个字符串是否是回文 -Completion of the stack abstract data type of the order, said that with the realization of the chain. The realization of functions: numerical conversion calculator (expression evaluation
palindrome
- 回文判断 输入一个字符串可以判断是不是回文。-Determine palindrome
number4
- 回文判别 实验要求:称正读和反读都相同的字符序列为“回文”,如“abba”和“abccba”是“回文”,“abcde”和“ababab”则不是“回文”,试设计一个算法,判别读入的一个以@为结束符的字符序列是否是“回文”。 实验目的: 1、掌握循环队列的定义及应用; 2、掌握队列的基本操作; 3、进一步熟练掌握栈的基本操作及应用; 4、初步学会解决具体问题的算法设计。-Experimental identification requirements palindrome:
h
- 回文判断:对于一个从键盘输入的字符串,判断其是否为回文。回文即正反序相同。如“abba”是回文,而“abab”不是回文。-Palindrome judge: for a string from the keyboard input, determine whether the palindrome. Palindrome sequence that is the same as the pros and cons. Such as " abba" is a palindrome
hui
- 编程求100到999之间的回文数.(回文数是指正读与反读都一样的数,如:232)-Programming for between 100-999 palindrome number. (Number palindrome correction and anti-time reading the same few, such as: 232)
huiwen
- 判断字符串中是否存在回文 如abcbe中bcb就构成了回文-String to determine whether there is such as abcbe in palindrome form the palindrome bcb
huiwen
- 利用栈的知识和队列的知识解决回文,方法很巧妙,可以参考-回文
huiwen
- 这是一个回文验证程序,自己写的.希望可以对你们有一定帮助喽!-This is a huiwen program
Number
- 本程序用于回文数的判断,输入一位数字,可以判断其是否为回文数字,不是返回提示-This procedure used to determine palindrome number, enter a single digit, you can determine whether the palindrome figures, not to return to prompt
回文数的判断
- 这个程序功能是完成对一个数据是否是回文数的判断(The function of this program is to determine whether a data is palindrome)
回文
- 数据结构解决c语言中的回文问题,使用堆栈队列等(The data structure solves the palindrome problem in the C language, using the stack queue, etc.)
最长回文字符串
- 给定一个字符串,找出该字符串的最长回文子串。(Given a string, find the longest palindrome substring of the string.)
Python算法:如何解决回文索引问题
- Python算法:如何解决回文索引问题 本文将给与解答(Python algorithm: how to solve the problem of the palindrome index)
Desktop
- 回文代码(来源知乎的轮子哥) 感觉很有趣,回文嘛(This is a code from brother,a big V of Internet. Palindrome code is so funny.)