搜索资源列表
f
- 用栈和队列实现的回文判断源代码 数据结构书中的c++实现-by c++
123
- 利用栈实现数制转换的算法和回文字符串的判定 -Use of stack number system conversion algorithms and palindrome string to determine
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
Palindrome
- 输入字符串，检查是否回文，如果是，将其输出。-Input string, check whether palindrome, if it is, its output.
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
huiwen
- 用程序判断一个句子或者一个单词是否是回文（即正读和反读完全一样的单词）-use a programme to decide whether a sentence or a word is the same using the natural sequence or the reversd order
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
Judgment-palindrome
- 回文判断！既可以判断类似POP,LOL等样式的字母，顺着看和倒着看一样的！-Palindrome judge! Either to determine the style of letters similar to POP, LOL, along to see and look backwards!
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
huiwen
- 该程序利用栈以及队列的基本知识，如：入栈，出栈等判断输入的字符串是否为回文。-The program utilizes the basic knowledge of the stack and queue, such as: the stack, the stack judgments input string is palindrome.
sicily3
- 输入一个字符串（字符串的长度不超过100），求出其中最长的回文子串的长度。子串的含义是：在原串中连续出现的字符串片段。回文的含义是：正着看和倒着看相同，如abba和yyxyy。-Enter a string (the length of the string is not more than 100), calculated the length of the longest palindrome substring. The substring meaning: the string frag
huiwen
- 数据结构中，用C++语言，用栈和队列实现回文-Data structure, stack and queue C++ language palindrome
CPP
- 通过数组的复制来实现回文数的判断，通过数组的复制来实现回文数的判断。-Array replication the palindrome judgment, the judgment of the palindrome array replication.
019
- 判断是否回文数对c语言初学者有一定用处，Determine whether the palindrome-Determine whether the palindrome
Palindrome-judgment
- 回文判断，能够判断文本文件中的一行文字是否为回文。回文即前后对称的文字。-Palindrome judgment, be able to judge the line of text in the text file is a palindrome. Palindrome i.e. symmetrical before and after text.
s2y1
- C语言编写算法，判断依次读入的一个以@为结束符的字母序列，判断其是否为回文序列。-Written in C language algorithm, a judge in turn read to the end of the letter for the @ symbol to judge whether the sequence, for palindrome sequence.
huiwen
- 本题要求给定字符串的最长回文子串长度，由于数据量过大，我们使用manacher算法求字符串的最长回文子串长度。-Can you propose an efficient algorithm to find the length of the largest palindrome in a string?
357
- 排序。判断是否回文。加密程序，将输入一字符串进行加密，字符串中所有字母加密，非字母字符不变。字母加密=如： A - F B - G .... Z - E 。-Sort. Determine whether the palindrome. Encryption program, the input string encryption to encrypt all the letters in the string constant non-alphabetic characters. Letter