搜索资源列表
palindrome
- 实验2：栈的应用--判断一个数是否是回文数 1、实验目的：掌握栈的特点及基本操作，包括入栈、出栈、判栈空等。 2、实验要求：任意输入一个数，判断其是否为回文数。 3、提示：可采用栈和链表结合进行。
palindrome
- A linked list can be operated as a stack and a queue since new items can be added to its beginning or to its end. In this tutorial, we will manipulate on linked lists such as reversing a list and comparing two lists.
2个简单程序
- 一个用C++编写的倒序输出的程序，以及判断一个字符串是否为回文简单的程序。-a C output prepared by the reverse procedure, and determine whether a string of Palindrome simple procedure.
Stack3 java
- 用堆栈实现回文算法 可以测试各种字符串 dos界面-using stack algorithm can achieve Palindrome test string dos interface
vcddd
- 都是以前随手编写的笑程序:总的来说只有五个<回文游戏,层次遍历二叉树,猴子选大王,先序、中序、后序遍历的递归算法等等> 如果对你又帮助你就下来看看吧-are readily prepared by the previous laugh : Overall only five lt; Palindrome games, the level traverse binary tree, monkey king election, the first sequence, sequence,
huiwen 写一个算法判断读入的一个以‘@’为结束符的字符序列是否为回文
- ．假设称正读和反读都相同的字符序列为“回文”，例如，“abcddcba”、 “qwerewq”是回文，“ashgash”不是回文。是写一个算法判断读入的一个以‘@’为结束符的字符序列是否为回文。 2． 要求用栈和队列共同实现。 3． 验证各操作的正确性。 -Palindrome made several
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.
mm
- 若一个数（首位不为零）从左向右读与从右向左读都一样，我们就将其称之为回文数。 例如：给定一个10进制数56，将56加65（即把56从右向左读），得到121是一个回文数。 又如：对于10进制数87： STEP1：87+78 = 165 STEP2：165+561 = 726 STEP3：726+627 = 1353 STEP4：1353+3531 = 4884 在这里的一步是指进行了一次N进制的加法，上例最少用了4步得
huiwenpanduan
- 利用堆栈和队列分别存储输入的字符串，再分别出栈和出队列实现回文的判断-Stacks and queues are stored using the input string, and then stack and a queue, respectively, to achieve a palindrome judgments
pprime
- 因为151即是一个质数又是一个回文数(从左到右和从右到左是看一样的)，所以 151 号是回文质数。 写一个程序来找出范围[a,b](5 <= a < b <= 100,000,000)间的所有回文质数 -The number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backw
huiwen
- 所谓回文就是从左向右读和从右向左读是一样的字符串。现在我们对任一字符串进行插入操作，使得新的字符串为回文格式。要求对给定字符串进行插入操作最少的次数。如Ab3bd,至少通过两次插入操作可以得到回文 ("dAb3bAd" or "Adb3bdA"). 输入含有多个例子。每个例子两行，第一行为N，字符串长度，第二行为字符串。N<=1000。而字符串值含有26个大写字母和26个小写字母。输入以N=0为结束。 -The so-called palindrome is read fro
String-reverse
- 符串逆序输出是C语言经典算法之一，过去利用数组下标处理此类问题，较为繁琐，本文给出 了利用指针实现任意给定字符串的逆序输出方法，以及在此基础上进行回文字符串判断的便捷方法。-Pointers with a C-string string in reverse order and determine palindrome
huiwen
- 回文判断，编写一个算法，判断依次读入的一个以@为结束符的字母序列，是否形如‘序列1&系列2 ’的字母序列。-Palindrome judge, write an algorithm to determine an order read to the letters @ the end of the symbol sequence, is shaped like a ' series 1 & series 2' of the letter sequence.
mms
- 高效的最长回文子串实现，原创，时间复杂度为O(nlogn)-Efficient realization of the longest palindrome substring, originality, time complexity is O (nlogn)
PalindromeNumber
- To find and output 11-999 between the number of m, it is to meet m, m2 and m3 are several palindrome. The so-called palindrome refers to the number of its symmetrical figures that the whole number, for example, 121,676,94249 and so on. To meet the ab
_ch301.c
- 回文判断,正与反都用相同的字符序列为准.用堆栈实现-Palindrome judge, is working with the anti-all with the same sequence of characters shall prevail. To use the stack to achieve
Practice1_15
- 找出回文数，就是在一定范围内找出顺读和倒读都一样的词语。-Palindrome identify a few, that is, a certain scope to identify cis and read back the words read are the same.
palindrome
- 输入字符串以 @ 结束,用&连接.利用顺序栈实现会问判断-Enter the string with ' @' The End, & connect with. The use of the order of the stack implementation will determine the question
PalindromeNumber
- 回文数就是从高位往低位读，和从低位往高位读是相同的，例如：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*
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