搜索资源列表
huiwen
- 判断文章是否是回文类型的程序源代码,回文的判断是左右对称类型的句子-To determine whether the article is a palindrome type of program source code, palindrome judgment is symmetrical type of sentence
a
- 一个数的各位数字倒过来所得到的新数叫原数的反序数. 如果一个数等于它的反序数,则称它为对称数或回文数。 求10000以内的二进制对称数.-The digits of a number of upside down to get a new number called the anti-ordinal number of the original number. If a number is equal to its inverse ordinal number, call it th
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
main
- 回文素数(回文数——从左到右和从右到左是看一样的;素数——指在一个大于1的自然数中,除了1和此整数自身外,没法被其他自然数整除的数。) -Prime Palindromes(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 backward). Write a program
jiancehuiwen
- 问题描述:对于给定的一个n个字符组成的字符串s,判断其是否为回文,设字符串s为: S:”C1,C2,…….Ci,Ci+1,…..Cn”,则对于P=(n/2),字符串s满足如下条件。 若n为偶数,则有C1=Cn,C2=Cn-1,….,Cp-1=Cp+2,Cp=Cp+1 若n为奇数,则有C1=Cn,C2=Cn-1,….,Cp-1=Cp+3,Cp=Cp+2. -The descr iption of the problem: given an n-character string s
huiwen
- 采用递归方法编程,检查一个任意给定的字符串是否是回文。-Programming recursion method to check an arbitrary given string is a palindrome.
fanweihuiwenshu
- 给定范围,如是几位数,然后在这个范围内求取其中最大的回文数-Given range, in the case of numbers that strike one of the largest palindrome in this range
wo
- 用顺序栈实现回文的判断,由用户数任意字符串可做出判断-The palindrome judgment order of the stack
JAVA-experiment-3
- 1、用循环语句打印一个99乘法表。 2、判断回文数(逆序排列后得到的数和原数相同)。 -1, with a 99 loop Print multiplication table. 2, to determine palindrome (reverse chronological order number and the same number).
vb
- 编程找出10000以内所有的回文数的平方仍是回文数的数。所谓回文数是指左右数字完全对称的自然数,例如:11,121,1221等都是回文数。-Programming to find the square of the 10000 within the palindrome is a palindrome number. The so-called palindrome is a natural number of the figure is completely symmetrical abou
123
- 利用栈实现数制转换的算法和回文字符串的判定 -Use of stack number system conversion algorithms and palindrome string to determine
huiwen
- 数据结构中回文判断问题,回文是数据结构中经典的问题之一,此程序可以判断输入字符串是否为回文-Palindrome determine whether the problem data structure, data structure palindrome is one of the classic, this procedure can determine whether the input string is a palindrome
main
- 找出最长的回文子串,输出的第一行为找到的最长的回文字符串的长度。后面的行应该包括该字符串,字符串两边多余的空格和标点都不需要输出,但字符串中的空格、标点和换行则需要按照原样输出。-To find the longest palindrome substring of the first acts of the output to find the longest palindrome length of the string. Back row should include extra spac
Palindrom1
- this programa tells you if a word is or is not a palindrome
Symmetry
- 使用传递函数指针的通用头文件实现的判断输入字符串是不是回文的一个小程序,但通用性很强-Use a common header file transfer function pointers implemented to determine the input string is not a palindrome a small program, but very versatile
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
- 设计算法,判断该字符串的前n个字符组成的是否为回文,且使算法时间复杂度最小。 (注:123321、abcdeedcba均为回文,但12321不是回文) -Design algorithm to determine the first n characters of the string is a palindrome, and the complexity of the algorithm time minimum. (Note: 123321, abcdeedcba are palin
huiwen
- 回文数,对于判断字符串可以有效地进行控制盒输出-Palindrome can effectively control box output string for judging