搜索资源列表
MoShiPiPei
- 有一串10000位数的主串由1、2、3、4四位数随机获得，n位模式串是指有4的n次方个模式串，如2位模式串有：11、12、13、14、21、22、23、24、31、32、33、34、41、42、43、44等16个数组成。现在进行模式匹配，假设主串为：431324113122341324132等等，则第一次比较是43，第二次比较是31，第三次比较是13，依此类推，每比较一次则落得模式串中的一个，当所有模式串（有4的n次方个）都被找到时，记得所比较的次数，则这个次数就是这次匹配的结果。程序执行了
1800Decorations
- 该源码是一个问题的解决方法。问题是给你个长为L的串，串中可以出现n种字符，还给出m个子串，求有多少个长为n的只由这些字串组成的串。输入例子：4 5 6 ABB BCA BCD CAB CDD DDA 结果为2.而5 4 5 E D C B A的结果为625-source of the problem is a solution. The problem is that you have the head of the L series, the series can occur n ch
2_60
- 求两个字符串的大小和长度 大小写敏感，当长度和大小写或字符不一致时为不等。-for two strings on the size and length of the case-insensitive, when the length and case-insensitive or inconsistent for the characters ranging.
1-4VB
- 一维交错格点法vb源程序, 取所有文本内容,然后以回车换行符进行字串分割.-a staggered grid method vb source files, a staggered grid peacekeeping law vb source files, access to all text, Then Enter newline for strings division.
suanfa
- 设A和B是2个字符串。要用最少的字符操作将字符串A转换为字符串B。这里所说的字符操作包括： 1. 删除一个字符 2. 插入一个字符 3. 将一个字符改为另一个字符 将字符串A变换为字符串B所用的最少操作数称为A到B的编辑距离，极为d(A,B)。设计一个算法，计算任意两个字符串的编辑距离。 -Set A and B are two strings. Operation will use the least character string A is converted to a
Hash_Table1616057162003
- A hash table that stores key/pointer pairs. The table can handle either numbers or strings as keys, you specify which type it is when you create it. When you use strings as the keys, you should store the key permanently yourself somewhere, such as in
CODE_UPLOAD8778892000
- Displays a rotatable and scaleable wire frame of any 3D mathematical function. This can be made up from the normal VB maths plus inverse and hyperbolic functions. Functions can be created and saved as wanted. Image vertices can also be saved
code
- 找出两个字符串的最长公共子串。 给出一个字符串，请删除该字符串的前导空格和尾随空格，中间的空格若多余1个删减到1个。 我是个菜鸟，但软件会是我终生的事业~我有信心学好它，希望站长通融-Two strings to find the longest common sub-string. Given a string, remove the string leading spaces and trailing spaces, if the extra spaces in the middle
ptypes-2.1.1.tar
- PTypes (C++ Portable Types Library) is a simple alternative to the STL that includes multithreading and networking. It defines dynamic strings, variants, character sets, lists and other basic data types along with portable thread and synchronization
labassigns
- collection of all basic programs using arrays ,strings and files in c
2
- 函数ReadDat( )实现从文件IN.DAT中读取一篇英文文章存入到字符串数组xx中；请编制函数StrOR( )，其函数的功能是：以行为单位依次把字符串中所有小写字母o左边的字符串内容移到该串的右边存放，然后把小写字母o删除，余下的字符串内容移到已处理字符串的左边存放，之后把已处理的字符串仍按行重新存入字符串数组xx中。最后main()函数调用函数WriteDat()把结果xx输出到文件OUT5.DAT中。-Function ReadDat () implementation from the
AlgoritmRabina_Karpa
- The Rabin–Karp algorithm is a string searching algorithm created by Michael O. Rabin and Richard M. Karp in 1987 that uses hashing to find any one of a set of pattern strings in a text. For text of length n and p patterns of combined length m, its av
3
- The Levenshtein Distance between two strings a, b is the number of changes to transform one string into another. For example to transform mouse into house would take 1 (change the m to an h). If the strings are different length then either characters
string
- Code C and program to test strings and char variables.
four
- 各种非线性方程及方程组求解算法，如弦截法，程序在C环境下通过-Equations of nonlinear equations and solving algorithm, such as strings cut method, the program in the C environment through
Keda-Matrix
- 可达矩阵求法 动态分配一维数组 去掉字符串中的空格和回车 将Cstring转换成int数组-Matrix Method to dynamically allocate up to one-dimensional array of strings to remove spaces and carriage returns will be converted to int array Cstring
ddhuffman
- 对任意一组输入的字符串进行哈夫曼编码，然后解码-Huffman coding and decoding on a set of strings
bm
- 为了最大程度地节约存储空间，经常需要把信息进行编码。一种很有效的编码方法是用数字来表示一串字符。假设这些字符串都是由不重复的英文小写字母组成的，且每个字符串中的英文字母都是从小到大排列的。 这个编码系统按照如下的方式工作： ◦ 字符串是按照长度从小到大的顺序排列的 ◦ 长度相同的字符串，是按照字典序排列的 -In order to save storage space to the greatest extent, often need to in
length
- 求两个字符串的最长公共子序列，可以手动输入也可以从文件读入字符串，字符串中允许有空格出现，这是广西大学的算法实验代码，如果是本校学生下载请注意修改，这是我自己写的，写得不好请海涵。-Seeking the longest common subsequence of two strings, you can manually input can also be read from a file into a string, string allows spaces appear, the algo
compare-two-strings-without-using-strcmp()-functi
- compare two strings without using strcmp() function