搜索资源列表
B
- 定义一个字符栈类CStack。私有数据成员：栈数组和指向栈顶的下标或指针；公有成员函数：构造函数、拷贝构造函数、压栈、出栈、清栈、访问栈顶元素、检测栈是否空，是否满等。用上述栈来做回文游戏。用户输入一行字符判断是否为回文。（回文：顺读和逆读字符串一样（不包括空格）；如：“a man a plan a canal panama”，就是回文）。注意过滤掉空格。-Defines a character class stack CStack.
pro9
- 如果一个数从左往右读和从右往左读都是一样，那么这个数就叫做“回文数”。例如，12321就是一个回文数，而77778就不是。当然，回文数的首和尾都应是非零的，因此0220就不是回文数。 事实上，有一些数（如21），在十进制时不是回文数，但在其它进制（如二进制时为10101）时就是回文数。 编一个程序，从文件读入两个十进制数N (1 <= N <= 15)S (0 < S < 10000)然后找出前N个满足大于S且在两种或两种以上进制（二进制至十进制）上是回文数的十进
back
- 回文分析C程序：可判断字符串内存储的是否为回文，可判断中英混合字符串。 回文样例：上海自来水来自海上。 ABCBA A我B市B我A-Palindrome analysis C program: to determine whether the string is stored as a palindrome, the judgment of mixed strings. Palindrome Example: Shanghai water from the sea. ABCBA
PrimeAndPalindrome
- 判断5到20亿之间的回文质数（也称回文素数）。采用构建奇数长度回文数的方法，将计算量级缩小。-Palindromic primes judge (also called palindromic primes) 5-2000000000 between. The method of constructing odd length palindrome, and will calculate the magnitude smaller.
Manacher
- Manacher算法 回文串O(n)解决方法 最快的回文串查找策略-Manacher palindrome string algorithm O (n) solution fastest palindrome string search strategy
HuiWenPrc
- 一个用c语言写的小程序，主要实现了计算回文数。适合新手理解-C language used to write a small program, the main computational palindrome. Suitable for beginners to understand
Desktop
- 实现对一串由用户输入的字符串判断其是否是回文的操作算法-Achieve a string of a string entered by the user to determine whether it is a palindrome operation algorithm
To-determine--palindrome-characters
- 要求从键盘中输入字符串，判断该字符是否为回文字符。-To determine whether for palindrome characters
huawei
- 华为上机题目，包括灯亮盏数、地铁换乘、最大最小值、括号匹配、回文数、将第一行中含有第二行中“23”的数输出并排序-Huawei computer subject, including the light lamp, transit, maximum minimum, parentheses matching, palindrome, will be the first line contains 23 the number of output in the second row and so
huiwenshu
- 回文数 打印所有不超过n(取n<256) 的其平方具有对称性质的数(也称回文数)。-Print all palindrome number does not exceed n (take n < 256) of its symmetrical nature of the square (also called a palindrome).
huiwen
- 解决回文数问题，这个程序是为了解决回文数而写的，所谓回文数，就是左右对称的数-Palindrome problem solving
huiwen
- 利用数据结构中栈与队列实现回文的判断 并含有栈队列等操作的定义-Is defined with the data structure stack and queue implementation Palindrome judgment and containing a stack queues operations
Desktop
- 字符串回文检测，三个数大小排序，等等小程序代码-String palindrome detection, three numbers in descending order, etc. applet code
math_test
- 计算任意1~L自然数中回文数字（形如：101,121,232,353的个数）的个数，输出结果存在文件Datafile中。 -CALCULATING 1 ~ L is a natural number of palindromic numbers (like this: the number of 101,121,232,353) number, the output of file Datafile in.
LongPlind_Remove
- 寻找回文子串是一道经典的面试题，本代码旨在解决字符可删情况下的寻找最长回文子串问题。-Finding the longest palindromic substring is one of the most typical face questions, the source code uploaded is aimed to finding the longest palindromic substring while the characters are removable.
0base-agorithm(2)
- 零基础C++算法编程1，包括回文数、递归算阶乘、哥德巴赫猜想等简单算法的代码-Zero-based C++ programming algorithm 1, including palindrome, recursive factorial operator, Goldbach conjecture and other simple algorithm code
huiwenzifu
- 利用c语言进行回文字符的判断，并给出了详细的注释。-Using c language palindrome characters to judge, and gives a detailed note.
huiwensu
- 回文数判断程序，如1234321是回文数，123456不是回文数-Palindrome number to determine the procedures, such as 1234321 is the number of palindrome, 123456 is not the number of palindrome
address_deiign
- 用堆栈实现回文算法可以测试各种字符串dos界面()
daima
- 使用栈和队列的结构来判断输入字符串是否为回文(Determine whether the input string is a palindrome)