资源列表
2
- C的算法程序，回文字符串问题，分享给需要的朋友
comparestring
- 给定两个集合A、B，集合内的任一元素x满足1 ≤ x ≤ 109，并且每个集合的元素个数不大于105。我们希望求出A、B之间的关系。 任 务 ：给定两个集合的描述，判断它们满足下列关系的哪一种： A是B的一个真子集，输出“A is a proper subset of B” B是A的一个真子集，输出“B is a proper subset of A” A和B是同一个集合，输出“A equals B” A和B的交集为空，输出“A and B are disjoint
Select
- 此函数的功能是依次选出两个小的数，不要求原来数组中的数按大小顺序排列。-The function of this function are followed by two smaller number of elected and does not require a number of the original array by the size of order.
ds_1
- 1．定义线性表的链式存储结构 2．在线性表的链式存储结构上，编写函数实现链表的初始化，插入、删除，输出、销毁等算法。-1. The definition of a linear form chain storage structure 2. Online sex store chain structure of the table, write a function to achieve the initialization list, insert, delete, export, des
zuichangdizengzishulie
- 所谓子序列，就是在原序列里删掉若干个元素后剩下的序列，以字符串"abcdefg"为例子，去掉bde得到子序列"acfg" 此程序可求出它最长的单调递增子序列。 -The so-called sub-sequences, that is deleted in the original sequence in a number of elements remaining after the sequence to the string abcdefg , for example, be r
58
- 通过双链表结构来查找学生的信息，这样的结构对于需要无规律反复读取链表元素的操作是很有用的-By double-linked list structure to find their information, so that the structure of the need to repeatedly read erratic operation of the list element is useful
KMP
- 模式匹配，大学二年级数据结构实验题，对主串和模式串进行模式匹配-Pattern matching, sophomore experiment of data structure, and mode of the main string pattern matching string
reverse
- 此功能是先设置要输入的字符串个数（一定是数字形式），然后相应输入每个字符串，最后会显示正序和倒序的结果。-This feature is to set the string to enter the number (must be in digital form), then the corresponding input for each string, and finally displays the result of the positive sequence and the rever
123
- 对考场座位根据学号进行自动排序，并且在输入考场号和学号后可以找到该同学-No. According to learn of the examination room seat automatically sort, and enter the examination room number and student number can be found after the student
Kjunzhi
- VC实现K均值算法，达到对图像进行非监督分类的目的-VC to achieve K-means algorithm to the image the purpose of unsupervised classification
C-languagetodeterminefileformat
- C语言判断文件编码格式C-language code to determine the file format-C-language code to determine the file format
Word-Ladder
- 给定两个词(beginWord和endWord)和字典的单词列表,找到所有最短转换序列(s)beginWord endWord,这样: 一次只能改变一个字母；每个中间必须存在于词列表-Given two words (beginWord and endWord), and a dictionary s word list, find all shortest transformation sequence(s) beginWord to endWord, such that: Onl