搜索资源列表
Palindrome-judgment
- 此程序为回文判断程序，是基于C++语言环境下的一个面向对象程序，主要涉及到C++语言数组知识的应用，供C++初学者学习 -This program is a palindrome judgment program, is based on an object-oriented program C++ language environment, mainly related to the application of the knowledge of C++ language array, f
panduanhuiwen
- 判断一个包含数字和字母的字符串是不是正序和倒叙一样，即是不是回文？-Determine a string of numbers and letters is not positive sequence and flashback, that is not a palindrome?
1
- 假设正读和反读都相同的字符序列为“回文”，例如，‘abba’和‘abcba’是回文，‘abcde’ 和‘ababab’则不是回文。试写一个算法判别读入的一个以‘@’为结束符的字符序列是否是“回文”。-Assuming a positive reading and anti-reads the same sequence of characters " palindrome" , for example, ' abba' and ' abcba' pal
A
- 输入一个字符串，然后判断该字符串是否是回文式，如"abcba"就是一个回文式。-Enter a string, and then determine whether the string is a palindrome, such as " abcba" is a palindrome type.
huiwenshu
- 华为编程大赛，回文数试题，值得一看，非常的经典！-Huawei programming contest, palindrome questions, the eye, very classic!
huiwen
- 回文算法，适用于C开发平台，非常实用和经典，便于参照和学习。-Palindrome algorithm for C development platform, very practical and classic ease of reference and learning.
CSADCWEEW
- 输出字符串的长度，判断数是不是回文数，找出1000内的所有元素-All elements of the output string length, the number of judgments is not a palindrome, find out the 1000
main
- 回文数判断程序，将输入的数转换成字符，调用判定程序实现功能-Palindrome judgment procedure will be entered into a number of characters, call the judge program functions! !
1-1000000000_huiwen
- 能够实现从1到10000000000的回文素数列举。效率较高，值得学习。-Can be achieved from 1-10000000000 palindromic primes enumerated. Higher efficiency, it is worth learning.
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.
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.
Palindrome
- 回文串,可以实现回文串的判断，忽略字符串中的英文字母的大小写-Palindrome string, string palindrome can judge ignored the letters in the string case