搜索资源列表
Substituter.java
- 代入法的启发示搜索 我的代码实现是:按照自然语言各字母出现频率的大小从高到低(已经有人作国统计分析了)先生成一张字母出现频率统计表(A)--------(e),(t,a,o,i,n,s,h,r),(d,l),(c,u,m,w,f,g,y,p,b),(v,k,j,x,q,z) ,再对密文字母计算频率,并按频率从高到低生成一张输入密文字母的统计表(B),通过两张表的对应关系,不断用A中的字母去替换B中的字母,搜索不成功时就回退,在这里回朔是一个关键。 -generation into a
Sort_scores
- 读入xls文档,完成对成绩的排序,然后重新写回xls。特点就是 ,可以输入不同的排序标准,完成不同的排序。-Read xls document, complete results of the sort, and then re-write back to xls. Feature is that you can enter a different sort criteria, the completion of a different sort.
algorithm-interview-questions
- 各大公司的算法面试题,包括逆序输出、回文判断、组合问题、随机分配等。-Each big company algorithm interview questions, including reverse output, palindrome judgment, combinatorial problems, stochastic distribution.
the-longest-palindrome-substring
- 对于给定的一个字符串,求出其中最长的回文子串。其中子串的含义是:在原串中连续出现的字符串片段。本算法采用C++编程,一定是你不错的选择!-For a given string,we should find the longest palindrome substring. Which means that the substring: string fragment in the original string of consecutive. The algorithm uses the C++
getAllPalindromeSubStr
- 给定字符串,求它的回文子序列个数。回文子序列反转字符顺序后仍然与原序列相同。例如字符串aba中,回文子序列为 a , a , aa , b , aba ,共5个。内容相同位置不同的子序列算不同的子序列。-Given a string, find its number of sub-palindromic sequence. Palindromic sequences reversed the order of characters remains the same as the original
main
- 求字符串中的最大回文子串(忽略大小写),并输出找到的回文串-find the maximum Palindrome in a string
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.
Prime-statistic
- 经过优化省时的素数统计,素数回文,统计因子和的源码,值得初学者学习。-After primes optimized saving statistics, palindromic primes, statistical factors and source code, it is worth beginners to learn.
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.
xunzhaohuiwenshu
- c语言课程设计,寻找回文数程序,包含了文件的读写操作-c language curriculum design, look for palindrome programs, including the operation of reading and writing files
stack
- 数据结构栈的演示程序,包括表达式求值,汉诺塔问题,回文判断、走迷宫问题等程序。- The stack data structure demo program, including expression uation, Hanoi problem, and take the program palindrome judgment maze problem etc..
4
- 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 个结点; 反转链表; 合并两个排序的链表; 两个链表的第一个公共结点; 链表中环的入口结点; 判断链表是否是回文结构; 删除链表中的重复结点; 复杂链表。