搜索资源列表
p
- 此程序采用直接生成回文数的方法,高效地实现回文素数问题-This program uses a direct method to generate palindrome, palindromic primes efficient implementation issues
liyongzhanheduiliepanduanhuiwen
- 数据结构中利用栈和队列来判断回文数列的C程序。-Data structure to determine the use of the stack and queue palindrome column C program.
five-classic--C-code
- 里面有五个C语言初学者遇到的经典递归问题的代码及详解!八皇后、回文、顺转矩阵、斐波那契及整数分划问题。-There are five classic C language for beginners recursive problems encountered by the code and explain! Eight queens, palindrome, clockwise rotation matrix, Fibonacci and integer partition problem.
duilie
- 1. 定义顺序队列类型,实现栈的所有基本操作。 2. 定义链队列类型,实现栈的所有基本操作。 3. 应用队列,编写测试函数判断字符序列是否为回文。 4. 编写测试程序。 -1 defines the type of queue order to achieve all of the basic stack operations. (2) define the queue type chain, to achieve all of the basic operation of th
Circular-queue
- 循环队列和链队列的基本操作,包括入队出队、取队头元素等,附带有杨辉三角、判断回文和舞伴配对的操作-the basic function of circular and linked queue.
777
- 证明任意一个数字,加上自己的逆序,反复多次都可以组成回文数-Prove any one figure, coupled with their own reverse, can be repeatedly composed palindrome
PointHuiwen
- 该程序完成了一个字符串的回文的输入和输出-The procedure was completed in a string of output.
RevSubStr
- 长度为N(N很大)的字符串,求最长回文串-Length N (N large) strings, find the longest palindrome string
HuiWenTest
- 用JAVA语言判断是不是回文,有几位数字并且输出出来。-JAVA language judgment is not a palindrome, several digital and outputs it.
wodehuiwen
- 用栈实现的判断是否回文算法,算法是自己写的,可以运行-Determine whether a stack to achieve the palindrome algorithm, the algorithm is to write, you can run
shujujiegou
- 1. 实验目的:掌握栈与队列的基本结构和操作方法,并能利用其解决实际问题。 实验内容:假设称正读与反读都相同的字符序列成为“回文”,试写出一个算法判别输入的一个以“@”为结束符的字符序列是否“回文” -1. Experimental Objective: To master the stack and queue the basic structure and methods of operation, and can use them solve practical problems.
functions
- 函数的定义与调用、杨辉三角、字符串连接、回文数、字符串比较函数、冒泡排序-some discr iptions of fuction
8-classical-algorithm-c-language
- 1.实现将输入的string字符串反序输出。 2.一个数如果恰好等于它的因子之和,这个数就称为"完数"。例如6 = 1+2+3找出10000以内的所有完数。 3.下面程序的功能是将一个4×4的数组进行逆时针旋转90度后输出,要求原始数组的数据随机输入,新数组以4行4列的方式输出 4.编程打印杨辉三角。 5.实现将输入的字符串反序输出 6.实现字符串拷贝函数strcopy(char*src,char* dest) 7.求近似Pi值。可以用公式(如:pi/2 = 1+1/3+
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
Palindrome
- 回文串,可以实现回文串的判断,忽略字符串中的英文字母的大小写-Palindrome string, string palindrome can judge ignored the letters in the string case
cpp
- 一些相关问题的c++计算。 包括算回文素数,算时间-some cpp yunsuan including huiwen sushu
huiwen
- VS 2008 下的 回文函数是想包含测试的主函数。-Palindrome function under VS 2008 is to contain the main function tests.
palindrome
- 用C++语言判断一串字符串是否回文,希望广大吧友支持-Determine whether the string with C++ language palindrome string of hope that the majority support it Friends
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