搜索资源列表
new
- 二叉树的基本功能、多项式求值、回文判断、二叉链表的实现学生基本信息创建等-The basic functions of a binary tree, polynomial evaluation, to determine the palindrome, the realization of the binary list of students and other basic information to create.
huiwen
- 回文程序利用堆栈实现输入一段文字,顺逆都相同-hui wen
huiwen
- 回文,输入字符串,强烈利用了堆栈使顺读逆读都相同-You can use this programe to realize the huiwen
huiwenshu
- C语言 回文数经典算法 巧用while语句-Palindrome
c
- C语言的一些简单经常用到的小工具程序段,比如说冒泡排序,回文数,素数分解等等。-Some of the C language simple and often use the gadget program segments, such as bubble sort, palindrome number, prime number decomposition and so on.
Looking-for-Palindrome-made-several
- 寻找并输出11~999之间的数m,它满足m、m的平方、m的立方均为回文数。所谓回文数是指其各位数字左右对称的整数,例如121、676、94249等。满足上述条件的数如 m=11,其平方为121,其立方为1331,皆为回文数。要求编制函数 int svalue(long m)实现此功能,如果是回文数,则函数返回1,反之则返回0。在主函数中将三重回文数输出。-Looking for and output 11 ~ 999 between several m, it satisfies m, m sq
huiwen
- 利用栈和队列的原理设计一个程序,对输入的字符串进行检测,以判断该字符串是否是回文数据,并输出判断结果。如:“abcxcba”或“abccba”都是回文数据。-Stack and queue principle to design a program to detect the input string to determine whether the string is a palindrome data, and outputs the judgment result. Such as: "a
wo
- 用顺序栈实现回文的判断,由用户数任意字符串可做出判断-The palindrome judgment order of the stack
f
- 用栈和队列实现的回文判断源代码 数据结构书中的c++实现-by c++
shujujiegou
- 栈回文、括号匹配等由C语言或C++语言编写的数据结构算法题-Stack palindrome
a
- 比n大的最小回文数问题,c语言简单实现。 主要考虑n的长度为奇数和偶数-Smallest palindrome larger than n, c language simple. The main consideration of the length of n for odd and even
huiwen
- 该程序利用栈以及队列的基本知识,如:入栈,出栈等判断输入的字符串是否为回文。-The program utilizes the basic knowledge of the stack and queue, such as: the stack, the stack judgments input string is palindrome.
liqueue
- 在Visual C++中实现: 1)创建一循环队列; 2)创建一个顺序栈; 3)利用栈和队列实现回文字符串的判定。 -failed to translate
Queue_Plalindrome
- 数据结构基础知识学习,判断字符串是否回文。用栈操作实现。-To learn basic knowledge of data structures, to determine whether a string palindrome. Stack operations.
PanDuan-HuiWen
- 利用栈的基本操作对某一字符串作出判断其是否为回文-Basic operations using the stack to make judgments on whether a string is a palindrome
RevSubStr
- 长度为N(N很大)的字符串,求最长回文串-Length N (N large) strings, find the longest palindrome string
palindrome_mem
- 包含了回文还有内存分配的基本函数,源码内含注释,可供读者理解。-Also contains a palindrome basic memory allocation functions, source code containing notes, for readers to understand.
UVaOJ-401(Palindromes)
- 判断输入字符串是否为镜像或回文串。 来源于UVaOJ - 401. 水题。-A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA" is a palindrome because it is the same when the string is read from left to rig
IsReverse
- 2. 链栈的应用:编写函数,判断给定的字符串是否回文。如字符串“abcba”、“abccba”均为中心对称,字符串“abcdba”不中心对称,我们将中心对称的字符串称为回文。-2. Chain stack applications: Write a function to determine whether a given string palindrome. If the string " abcba" , " abccba" are the center o
key_Queue
- 3. 参考void Reverse(LinkQueue &Q)函数,定义新的函数int Palindrome_Test(char str[]),判断字符串str是否回文序列,若是则返回1,否则返回0。写出程序或用文字描述算法的执行步骤。-3. Reference void Reverse (LinkQueue & Q) function, define a new function int Palindrome_Test (char str []), to determine wheth