一个简单的网络爬虫，使用SQL sever数据库 给初学者参考

根据产品特性与需求，设置产品的条码格式，控制产品是否与工单信息相符，如不符合，则扫描FAIL,弹出提示；并按照单箱容量设置，提示满箱跟换箱号等信息提示，避免产品的短装，多装，错装现象，改善工厂产品的包装品质，将产品数据存与ACCESS数据库中，便于查询、修改等功能拓展。

很适合初学者《数据结构实验与实训教程》（PDG）.zip- Suits the beginner very much "Construction of data Experiment And Really Teaches Course" (PDG) zip

建立带表头结点的单链表，打印所有结点的数据域；输入一个值，若某个结点的数据域为该值，则在其后插入另一个新结点，若无此结点，则在表尾插入新结点，然后打印；给一个值，删除结点的数据域是该值的所有结点，然后打印。（表生成时可用前插法或后插法）-table with the establishment of the first node of a single linked list, print all nodes of the data domain; An input value, If a node"s data fields for the values, and subsequently inserted in a new node, in the absence of such nodes, at the end of the insertion of a new form nodes, then Print; to a value of the node to delete data domain is the value of all the nodes, then Print. (Table Generation available houses or after interpolation)

图的邻接矩阵存储结构 图的优先深度遍历-Graph adjacency matrix storage structure of the priority depth traversal

简单介绍了一种数据结构的构建及其使用情况,-introduces a simple data structure of the building and its use,

用O(nlogn)的算法对Cograph进行识别-O (nlogn) algorithm for the identification of Cograph

db2建库代码和开发文档 帮助初学者更好的学习db2-db2 database code and the development of documentation to help beginners better learning db2

求解约瑟夫问题。设有n个人围成一个圆圈坐下，对所有围从的人从某个位置开始编号为1,2,3，……，n,从编号为1的人开始报数1，报数依交进行，报数n的人即出列，下一个人从1开始报数，再报数m的人便是第二个出列的人如此重复下去，直到最后一个人出列为止，于是便得到一个出列的顺序，这称之为约瑟夫(Josephu)问题。-solving problems. N individuals have formed a circle to sit down, all right Wai from the start from a position of No. 1, 2, 3, ..., n, for a number of people reported a few, according to several newspaper pay, the newspaper n ie the out, the next person was from the beginning a few , and reported m is the second out of this series continue to repeat until the final out in a series, then get a series out of order, which called Joseph (Josephu) problem.

对给定书的总页码，计算出书的全部页码中分别用到多少次数字0，1，2，3...9.-DataStatistics

][String]有多种方法可以使整个字符串排列，（不重复）整个数组，还有字典方法