搜索资源列表
stringmatch
- 高速多字符串匹配程序，基于多字符串的KMP算法开发，能够实现多字符串的匹配-High-speed multi-string matching procedure, based on multi-string KMP algorithm development, to achieve multi-string match
HuffmanCode
- 数据结构课程Huffman编码实验课程作业，具有完整控制台界面，实现功能1.由字符串生成huffman码2.打印huffman树3.由huffman码还原为字符串-Data structure course experiment coursework Huffman coding, with a complete control panel interface, the realization of function 1. Huffman code generated by the string
c_methods_of_quick_sort
- 几种快速排序的方法，对int类型数组排序，对char类型数组排序，对double类型数组排序，对结构体一、二级排序，对字符串进行排序，计算几何中求凸包的cmp-Several methods of quick sort, sort array of type int, the type of char array to sort, sort array of double type of the structure of primary and secondary sort, sort of s
chapter4_class_28690304
- 数据结构中，关于对字符串的定义，方便编写程序的时候调用-Data structure, with regard to the definition of the string, to facilitate the preparation process when the call
SundayAlgorithm
- 字符串高效匹配算法Sunday，是目前单字符串匹配算法中最为高效的一种。-Efficient string matching algorithm Sunday, is currently the single most efficient string-matching algorithm as a.
MyString
- C 语言写的字符串处理方法 依据数据结构的方法编写的关于串处理的各个函数-Written in C language string handling methods based on the data structure prepared by the various string handling functions
1
- 字典序问题：在数据加密和数据压缩中常需要对特殊的字符串进行数字编号。给定的字母表 A 由 26 个小写英文字母组成 A={a,b,…,z}。该字母表产生的升序字符串是指字符串中字母按照从左 到右出现的次序与字母在字母表中出现的次序相同，且每个字符最多出现1 次。例如， a,b,ab,bc,xyz等字符串都是升序字符串。现在对字母表A 产生的升序字符串按照字典序排列 并编号如下。-Lexicographic problem
KMPandmax_match
- 1,KMP:实现了在一个字符串中查找字串的高效算法，复杂度为O（m+n） 2，max_match：求两个字符串的最大匹配字串 在vc6.0中调试通过，可以使用-1, KMP: realized in a string to find String efficient algorithm complexity is O (m+ n) 2, max_match: seeking two strings maximum matching string in the vc6.0 debug en
kmp
- KMP String Matching VC++实现的KMP字符串匹配算法-KMP String Matching VC++ implementation of the KMP string-matching algorithms
paixu
- 经典的排序方法实现，可做子程序使用。包括整数、实数、字符串的快速排序。主要采用冒泡法。-Classic sorted implementation subroutine used to do. Including integers, real numbers, strings quicksort. Mainly uses the bubble method.
CRealNumberString_Complete1_6_rar
- 采用字符串模拟double型数据的计算，包括一个double型数据的前驱和后继，以及加减乘除等运算。-Double-type data using a string simulation calculations, including a double-type data, predecessor and successor, as well as operations such as addition and subtraction multiplication and division.
L_A_distance
- Levenshtein 距离算法实现。Levenshtein 距离测量两个字符串的相近性-The "Levenshtein distance" is a measure of the similarity between two strings, this algorithm is also refered to as "edit distance".
nowangyuyan
- 将魔王语言（包含大写字母的字符串）转换成小写字母并输出对应的中文并输出-The devil convert language into English and output
StringCompare
- 找出两个字符串的最大相等子字符串，-To find the largest sub-string of two strings
33
- 实验目的：熟练掌握字符串处理以及循环控 问题描述 实现移位密码：k表示26个字母向前循环位移的字符个数 加密： 输入：k，以及小写表示的明文字母，输出：大写字母表示的密文 解密：输入：k，以及大写字母表示的密文，输出：小写字母表示的明文 -Experimental Objective: To master the string processing and circulation control descr iption of the problem to achieve
zcggzc
- 用递归算法对输入的任意两个字符串求最长公共子串及其出现次数-Recursive algorithm to seek the input any two strings and the longest common substring occurrences
1165
- 在字符串中查找数字的个数，输出数据个数和所有的数据-Numbers in the string to find the number, the output data and all the data on the number of
Cpp2
- 输入字符串以链表的形式存储，在链表中查找一个元素，删除一个元素-Enter string to the list in the form of storage, find an element in the list, delete an element
xianxingbiao
- 输入以字符串，依顺序表存储，查找一个元素，删除一个元素-Input to a string, depending on the order of tables to store, find an element, delete an element
test6-2
- 描述 问题描述： 给定一个只包含数字[0..9]的字符串，求使用字符串中的某些字符，构建一个能够整除15的最大的整数。 注意，字符串中的每个字符只能使用一次。 编程任务： 求由给定字符串构建的能够整除15的最大整数。-Descr iption of the problem descr iption: Given a contain only numbers [0 .. 9] of the string, seeking to use some of the charac