搜索资源列表
2.rar
- 题目：一个5位数，判断它是不是回文数。即12321是回文数，个位与万位相同，十位与千位相同。 1.程序分析：同上
huiwenshu
- 关于回文数的代码 很简短 可以用于数字于字母 嘻嘻^_^ -Palindrome on the number of code can be very brief in the alphabet for digital hee hee ^ _ ^
hwmaxsize
- 按最大值的回文判断 数据结构我这学期才学的 这是我们的实验啊-Palindrome I judged data structure of this semester scholarship This is our experimental ah-huh
hw@
- 按表识符的回文判断 数据结构我这学期才学的 这是我们的实验啊
huwenchuan
- 回文串程序 随意输入一断字符串，检验其是否是回文串 主要以动态数组来实现-Palindrome procedures random input strings a broken string, the test is whether the Palindrome Series main dynamic arrays to achieve
aba
- 试写一个算法判别读入的一个以‘@’为结束符的字符序列是否是“回文”-try to write an algorithm for the discriminant read into a '@' website at the end of the sequence of characters is whether the "Palindrome"
huiwen
- 回文判断 和八皇后完整文挡-Palindrome judgment and eight Queen's complete text block
1112333
- 随便输入一个数活一个字符串，能够判断输入的是否为回文数，即从左边读过来和右边多过来一样-casually importation of a few live a string, to determine whether the imported downfall, that is read from left to right and up over the same
3_Huiwen
- 回文游戏，c语言，有源码，可以参考研究使用。-palindrome games, c language, and the source code can reference study.
Ex6_17
- 用一个堆栈实现回文的测试程序,分测试的字符长度是奇数还是偶数个两中情况-achieve with a stack Palindrome testing procedures, test-length of the characters is odd or even number-two situation
java_huiwen
- 这个例子是Java回文的例子，是从网上下的，感觉看这个程序还是比较看的懂的-this example is the Java palindrome example is from the Internet under the impression that this procedure can still do more to understand the
huiwenshuchu
- 一个Java应用程序，用户从键盘输入一个1～99999之间的数，程序将判断这个数是几位数，并判断这个数是不是回文数。回文数是指将该数含有的数字逆序排列后得到的数和原数相同，例如12121、3223都是回文数。-a Java application, user input from a keyboard 1 ~ 99,999 between the number of This procedure will determine the n
huiwen333
- 这是一个关于回文数的判断算法!只要输入的数据形式是回文形式,将输出该回文数是回文模式!-This is a palindrome number on the judgment algorithm! As long as the form of data input is palindrome form Palindrome will output the model number is palindrome!
number
- 输入范围，可以输出一定范围内的全部回文素数例如，12321(nput range, you can output a certain range of all palindrome prime number)
Palindrome subsequences
- 求一个长度不超过15的字符串的回文子序列个数（子序列长度>=1）。 输入描述：输入一个长度不超过15的字符串,字符串均由小写字母表示 输出描述：输出其回文子序列个数 样例输入：abaa 样例输出：10(Find the number of palindrome subsequences of a string of no longer than 15 (subsequence length &
Reverse
- 通过java语言，输出键盘输入的文字的回文(Through the java language, the output of keyboard input text palindrome)
Desktop
- 回文代码（来源知乎的轮子哥） 感觉很有趣，回文嘛(This is a code from brother,a big V of Internet. Palindrome code is so funny.)
PALINDROME
- MIPS assembly，汇编实现输入一个字符串，判断其是否为回文(MIPS assembly, the compilation includes a string input to determine whether it is a palindrome)