搜索资源列表
huiwen333
- 这是一个关于回文数的判断算法!只要输入的数据形式是回文形式,将输出该回文数是回文模式!-This is a palindrome number on the judgment algorithm! As long as the form of data input is palindrome form Palindrome will output the model number is palindrome!
huiwenshu_kechengsheji
- 数据结构里关于回文数判断的算法 另一种思路另一种解决办法~-data structure, palindrome number judgment on the algorithm Another idea Another solution ~
huiwenshu
- 回文数的判断，用栈和队列做的！希望大家可以互相交流一下-Palindrome number of judgments, with stacks and queues to do! Hope that we can exchange what
all
- C语言写的大部分算法问题，比如回文数，素数，等。-Most algorithms written in C language problems, such as palindrome, prime, and so on.
1
- 判断回文数的算法，代码简洁易懂，注释清晰明了-Algorithm to determine palindrome, code easy to read, comment clarity
HWEN
- 回文数猜想算法C语言经典实现，运行看看，猜想数字里的其他奥妙吧-Palindrome conjecture algorithm to achieve the classic C language, run to see, guess it figures in the other wonders
huiwen
- 输入一个字符串，判断是否为回文串或回文数-failed to translate
zhanduiliesuanfa
- 一、数制转换问题；二、回文判断；三、括号匹配的检验。-A number system conversion two palindromic judge three, bracket matching test.
huiwen
- 《数据结构》实验三：“回文”判断---本程序，主要利用队列、字符数组来进行判断-" Data structure" Experiment 3: " palindrome" judge--- the program, the main advantage of the queue, to judge the character array
huiwen
- 回文序列 编写一个程序 来判断所输入的数字是否为回文数 回文数是指如：98789, 这个数字正读是98789,倒读也是98789,正读倒读一样，所以这个数字就是回文数。-hui wen shu xu lie
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
a
- 比n大的最小回文数问题，c语言简单实现。 主要考虑n的长度为奇数和偶数-Smallest palindrome larger than n, c language simple. The main consideration of the length of n for odd and even
４
- 1、用键盘输入一字符序列，存入一字符数组中； 2、利用堆栈判断其是否中心对称（回文数据），并输出结果。(1. Input a character sequence with a keyboard and put into an array of characters. 2, use the stack to judge whether it is central symmetric (the palindrome data) and output the result.)