Location:
Search - palindrome
Search list
Description: 字符串回文简便算法,JAVA代码,包括自动处理空格\标点符号以及其他字符串等.-Palindrome algorithm using Java code
Platform: |
Size: 1024 |
Author: 王梓 |
Hits:
Description: 包括角谷,色子,回文等矿大JAVA实验课留的作文-Including Kakutani, bosons, palindrome, such as large mining JAVA experimental composition class to stay
Platform: |
Size: 5120 |
Author: shen |
Hits:
Description: 输入字符串以 @ 结束,用&连接.利用顺序栈实现会问判断-Enter the string with ' @' The End, & connect with. The use of the order of the stack implementation will determine the question
Platform: |
Size: 1024 |
Author: 周永飞 |
Hits:
Description: 编写一个java应用程序。用户从键盘输入一个1-9999之间的数，程序将判断这个数是几位数，并判断这个数是否回文数。回文数是指将数含有的数字逆序排列后得到的数和原数相同，例如12121,4224,6778776等都是回文数。
1）程序具有判断用户的输入是否为合法整数的功能。对非法输入（例如含有字母）要进行处理。
2）要判断输入数的位数，并输出相关信息。
3）要判断是否回文数。
二、二战期间，英国情报人员获取德军的一机密电报，电报的内容为：
bzdz izu sxgzd vs lh ,vpzg woflsh vs vwrh vhlsddlmp glm wrw gzy vsg .gflyz gstfzu bvsg gzsd hdmlp vml lm ,hghzvy wmz hwiry mvvdgvy izd z hzd vivsg ,ltz tmlo tmlO
情报人员已经知道，这段电报的加密方式为：
1. 首先将字符串的顺序颠倒。
2. 字母互换的规律为：A->Z, B-Y, C-X...X->C, Y->B, Z-A a->z, b->y, c-x...x->c, y->b, z->a.
3. 非字母字符保持不变。
请编程帮助情报人员破译这份机密电报。给出注释良好的源程序和程序运行后的结果。
-Write a java application. User keyboard input from a number between 1-9999, the program will determine the number of a few are a few, and to determine whether the number of palindrome number. Palindrome refers to a number of the figure contains a number of reverse order and after a number of the original number of the same, such as the number of 12121,4224,6778776 are palindrome.
1) procedures to determine whether the user s input as a legitimate function of an integer. Illegal input (such as with letters) to deal with.
2) To determine the median number of input and output-related information.
3) To determine whether the palindrome number.
Second, during World War II, British intelligence agents to obtain a confidential German Telegram, Telegram says:
bzdz izu sxgzd vs lh, vpzg woflsh vs vwrh vhlsddlmp glm wrw gzy vsg. gflyz gstfzu bvsg gzsd hdmlp vml lm, hghzvy wmz hwiry mvvdgvy izd z hzd vivsg, ltz tmlo tmlO
Intelligence agents are already aware, this encryption method
Platform: |
Size: 74752 |
Author: king |
Hits:
Description: 回文数就是从高位往低位读，和从低位往高位读是相同的，例如：131，1221等，此程序是寻找m，要求m,m*m,m*m*m,这三个值都是回文数。-Palindrome number is read from a high level to low and from low to high time is the same as, for example: 131,1221 and so on, this procedure is to find m, the requirements m, m* m, m* m* m, the three values palindrome are few.
Platform: |
Size: 7168 |
Author: 白秋杨 |
Hits:
Description: 完成堆栈抽象数据类型的顺序、链式表示与实现。实现功能：数值转换，计算器（表达式求值），迷宫求解，判断某个字符串是否是回文
-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), to solve the maze to determine whether a string is a palindrome
Platform: |
Size: 32768 |
Author: 韩非 |
Hits:
Description: Reverse and Add
195 Initial number
591
-----
786
687
-----
1473
3741
-----
5214
4125
-----
9339 Resulting palindrome
Platform: |
Size: 24576 |
Author: mini |
Hits:
Description: 判断一个整数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.
Platform: |
Size: 885760 |
Author: 007 |
Hits:
Description: 回文判别
实验要求：称正读和反读都相同的字符序列为“回文”，如“abba”和“abccba”是“回文”，“abcde”和“ababab”则不是“回文”，试设计一个算法，判别读入的一个以@为结束符的字符序列是否是“回文”。
实验目的：
1、掌握循环队列的定义及应用；
2、掌握队列的基本操作；
3、进一步熟练掌握栈的基本操作及应用；
4、初步学会解决具体问题的算法设计。-Experimental identification requirements palindrome: that is read and the anti-time sequence of characters are the same as a " palindrome" , such as " abba" and " abccba" is " palindrome" , " abcde" and " ababab" is not " palindrome" and try to design an algorithm to determine a time to @ for the character sequence at the end of it is " Palindrome." The experiment was: 1, master cycle and application of the definition of the queue 2, master the basic operation of the queue 3, and further stack master the basic operation and applications 4, a preliminary settlement of specific issues of the Institute of algorithm design.
Platform: |
Size: 1024 |
Author: 鹃 |
Hits:
Description: 回文判断：对于一个从键盘输入的字符串，判断其是否为回文。回文即正反序相同。如“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, and the " abab" is not a palindrome.
Platform: |
Size: 239616 |
Author: qazqaz |
Hits:
Description: 检测输入字符串是否为回文，即首尾对应位置的字符相同-Detection of input string is a palindrome, that is, both the characters corresponding to the same location
Platform: |
Size: 100352 |
Author: 多丽君 |
Hits:
Description: 编程求100到999之间的回文数.（回文数是指正读与反读都一样的数,如：232）-Programming for between 100-999 palindrome number. (Number palindrome correction and anti-time reading the same few, such as: 232)
Platform: |
Size: 2048 |
Author: 时攀 |
Hits:
Description: 实验内容
回文，冒泡排序，十进制转换成二进制，二进制转换成十六进制，输入数据 存入文件 并从文件中读出并显示在屏幕上-Palindrome content of the experiment, Bubble Sort, decimal converted to binary, hexadecimal into binary, the input data into the file and read from the document and display on the screen
Platform: |
Size: 41984 |
Author: 符晓娟 |
Hits:
Description: 关于制造回文
描述
回文，亦称回环，是正读反读都能读通的句子，亦有将文字排列成圆圈者，是一种修辞方式和文字游戏。回文运用得当，可以表現两种事物或现象相互依靠或排斥的关系。总有人以为回文是英文的专利，其实不然，中文中也有很多回文的例子，譬如：
莺啼岸柳弄春晴， 柳弄春晴夜月明。
明月夜晴春弄柳， 晴春弄柳岸啼莺。
看着很有意思，可要想写出回文，并不是一件很容易的事情。如果有一个字符串，怎样才能插入最少的内容，把它变成回文呢？
例如，要想把字符串 "Zb3bd" 变成回文，就需要插入两个字符，变成 "dZb3bZd" 或者 "Zdb3bdZ"，插入一个字符，是肯定不行的。
输入
输入的第一行是字符串的长度 N，3 <= N <= 5000，第二行是一个长度为 N 的字符串。该字符串由英文大小写字母和数字组成，英文大写字母和小写字母是不同的。
输出
程序输出要把该字符串变成回文，需要插入的最少字符数。-On the manufacture of palindrome
Platform: |
Size: 1024 |
Author: shi |
Hits:
Description: 判断字符串中是否存在回文
如abcbe中bcb就构成了回文-String to determine whether there is such as abcbe in palindrome form the palindrome bcb
Platform: |
Size: 864256 |
Author: 王王 |
Hits:
Description: 数据结构严蔚敏版第三章部分习题答案
栈的基本操作，算法
括号匹配
回文数判断
等
完整工程
vc++开发环境-YAN Wei-min data structure version of Chapter III of part of the answer to exercise the basic operation of the stack, the algorithm to determine the number of brackets, such as matching palindrome complete works vc++ development environment
Platform: |
Size: 775168 |
Author: Emily |
Hits:
Description: 利用顺序队列验证输入的一段字符并判断是否为回文-Order to verify the use of input queue and for some characters to determine whether the palindrome
Platform: |
Size: 1024 |
Author: jack cheng |
Hits:
Description: 回文问题，这是很有意思的一个问题，通过数据结构中的顺序队列可以解决。-Palindrome, which is a very interesting problem, through the data structure in the order in the queue can be resolved.
Platform: |
Size: 1024 |
Author: 熊龙龙 |
Hits:
Description: 输入一个数，选择判断是平方数，回文数还是素数。-Enter a number, select the square to determine the number of prime numbers or the number palindrome.
Platform: |
Size: 270336 |
Author: 黄梓能 |
Hits:
Description: 当你输入任意一个数十，就能输出第n个回文数，主要是数学题-When you enter any one of dozens, we can output the first n palindrome few months, mainly mathematical problems
Platform: |
Size: 1024 |
Author: chencyc |
Hits: