搜索资源列表
huiwen
- 检测输入字符串是否为回文，即首尾对应位置的字符相同-Detection of input string is a palindrome, that is, both the characters corresponding to the same location
hui
- 编程求100到999之间的回文数.（回文数是指正读与反读都一样的数,如：232）-Programming for between 100-999 palindrome number. (Number palindrome correction and anti-time reading the same few, such as: 232)
huiwen
- 判断字符串中是否存在回文 如abcbe中bcb就构成了回文-String to determine whether there is such as abcbe in palindrome form the palindrome bcb
text
- 数据结构严蔚敏版第三章部分习题答案 栈的基本操作，算法 括号匹配 回文数判断 等 完整工程 vc++开发环境-YAN Wei-min data structure version of Chapter III of part of the answer to exercise the basic operation of the stack, the algorithm to determine the number of brackets, such as matchi
huiwen
- 利用栈的知识和队列的知识解决回文，方法很巧妙，可以参考-回文
huiwen
- 这是一个回文验证程序，自己写的.希望可以对你们有一定帮助喽！-This is a huiwen program
Number
- 本程序用于回文数的判断，输入一位数字，可以判断其是否为回文数字，不是返回提示-This procedure used to determine palindrome number, enter a single digit, you can determine whether the palindrome figures, not to return to prompt
CheckPalindrome
- 检测一个字符串是否为回文串,对于一个字符串，如果从前向后读和从后向前读都一样，则成为回文串。-It can check a sring is a palindrome or not
7
- 编程找出10000以内所有的回文数的平方仍是回文数的数。所谓回文数是指左右数字完全对称的自然数，例如：11，121，1221等都是回文数。-All of the programming find within 10,000 square is still the number of reported the number of reported. So-called palindromes number refers to the specified number of symmetrical
nixu
- 逆序输出内容，可在此程序的基础上写出回文式的程序 ~-Reverse output, you can write this program based on the type of program palindrome ~
RB
- 回文实现 栈在VC上实现的基本操作以及实际问题的操作-Stack palindrome in the VC to achieve realization of the basic operation and the operation of the practical problems
test2
- 老师让我们写个回文数的小程序，* 题目分析与算法设计 对于要判断的数n，计算出其平方后(存于a)，将a的每一位进行分解，再按a的从低到高的顺序将其恢复成一个数 k(如n=13，则a=169且k=961)，若a等于k则可判定n为回文数。-Let the teacher write a palindromic number of small programs,* the subject analysis and algorithm design is to determine the n
cplusplus
- 链表 回文判别 多态性 返型程序设计和STL编程-Palindrome-based distinguishing polymorphism of the list back to program design, and STL programming
huiwenshu
- 输入一个字符串，如果这个字符串时对称的，则说明这个数十回文数，否则不是-Enter a string, if the string symmetry, then the dozens of palindromic number, otherwise not
huiwen
- 实现了一段字符是否为回文的判断《数据结构》-huiwen
huiwen
- 这个程序是用C++编写的判断是否是回文的程序，回文指的是例如abcba，这样的字符串就为回文。-This program is written in C++ program to determine whether the palindrome, palindromes refer, for example abcba, such as the string on the palindrome.
Stack
- stack 类的应用 回文检测 ，进制转换-program of stack .using c++
huiwen
- VB环境做的回文数判断，初级的简单东西，自己做的-VB-palindromic done to determine the number of primary simple things, doing their own
CostforIdeal
- 判断字符串是否可以构成回文串，如果可以，将该字符串转为回文串形式，并求出最小交换次数，必须是相邻符号间交换。-To determine whether the string can constitute a palindrome string, and if so, the string is palindrome strings to form and find the minimum switching frequency, must be exchanged between adjacen
MyProject
- C++程序设计实验题 回文 矩阵转换 矩阵最大值最小值问题 分配内存释放内存模仿 统计字符数目 -c++ execise