搜索资源列表
4.4.1
- 判定给定字符向量是否为回文（从左向右读和从右向左读相同的字符序列）。-Determine whether a given character vector palindrome (reading from left to right and right to left reading the same sequence of characters).
longestPalindrome
- 求最长回文子串 第一种解法：动态规划（内存分配较多，且时间复杂度为O(n^2)）第2种解法:Manacher算法-Find the longest palindrome substring First Solution: Dynamic Programming (memory allocation more, and the time complexity is O (n ^ 2)) The second solution: Manacher algorithm
palindrome
- 回文在Visual2010编译环境下的实现方法。-palindrome on visual2010
stack
- 数据结构课后作业-栈 对输入文字进行回文验证.-Data structure after-school homework- stack Validation of the input text are palindromes.
algorithm-interview-questions
- 各大公司的算法面试题，包括逆序输出、回文判断、组合问题、随机分配等。-Each big company algorithm interview questions, including reverse output, palindrome judgment, combinatorial problems, stochastic distribution.
huiwen
- vc++代码，判断一个链表中是否是回文链表，比如元素为abcba，1234321的链表是回文链表。-Vc++ code, determine whether the palindrome list is a list, such as the elements of abcba, 1234321 of the list is a palindrome list.
5-Longest-Palindromic-Substring
- “回文串”是一个正读和反读都一样的字符串，比如“level”或者“noon”等等就是回文串。回文子串，顾名思义，即字符串中满足回文性质的子串。 Manacher算法- Palindrome string is a positive reading and verlan are the same string, such as level or noon and so is a palindrome string. Palindrome substring, by definitio
PalindromeJudge
- c++代码，代码功能为：判断一个字符串是否为回文串-c++ code, the code for the function: to determine whether a string is a palindrome string
Shortest-Palindrome
- 给定一个字符串,你可以将它转换成一个回文通过添加字符在它前面。找到并返回最短的回文可以发现通过执行这个转换。 例如: 鉴于“aacecaaa”,返回“aaacecaaa”。 鉴于“abcd”,返回“dcbabcd”。-Given a string S, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest p
Palindrome-judgment
- 回文判断的C++程序，迭代实现，很有参考价值-Palindrome judge C++ program, iterative implementation, a good reference value
Manacher_Longest_Subsequence
- 求一个字符串的最长回文子串的长度。比如字符串 abaaba 的最长回文子串的长度就是6.-Seeking a string longest palindromic substring length. For example, the string " abaaba" longest palindromic substring length is 6.
stack
- 数据结构栈的演示程序，包括表达式求值，汉诺塔问题，回文判断、走迷宫问题等程序。- The stack data structure demo program, including expression uation, Hanoi problem, and take the program palindrome judgment maze problem etc..
４
- 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.)
DP
- 有两个小程序，都是动态规划的思想，对于回文字符串的应用，体现了动态规划的特点(There are two programs,which are both the applications of dynamic programming.)
E2
- 怎样使用数据结构算法实现判断回文数字的程序(Using data structure algorithm to judge the palindrome)
数据结构-链表学习
- 单向链表、从尾到头打印链表、链表中倒数第K个节点、反转链表、合并两个排序的链表，两个链表的第一个公共节点，链表中环的入口节点、判断链表是否是回文结构，删除链表中重复节点，删除链表中相邻重复节点、复杂链表、复杂链表的复制
数据结构-链表学习
- 单向链表； 从尾到头打印链表； 链表中倒数第 k 个结点； 反转链表； 合并两个排序的链表； 两个链表的第一个公共结点； 链表中环的入口结点； 判断链表是否是回文结构； 删除链表中的重复结点； 复杂链表。