带通配符的字符串匹配算法源代码

在0和1情况下进行背包问题解决，涉及多个物体的重量和价值，求得最大价值量以及分配方案。-At 0 and 1 backpack case for problem-solving, involving more than the weight of objects and values, as well as to achieve maximum value distribution program.

一个封装好的优先队列,用C++实现的,已经经过调试,直接用就行-A good package priority queue, using C++ Realize, and have been debugging directly on the line

相对于实验一，新增了2个类。 Class Listing vector. Class Group vector. 使用到了向量。增强了大家对STL向量容器，以及实现所给的声明函数。 压缩包里面有代码，指导书，以及Apache服务器。-Prerequisites: Students should have mastered the following prerequisite skills. C++ Class Specification- Produce C++ class implementations Standard Template Library- Knowledge of the STL, particularly sequential containers and iterators Goals: This assignment is designed to reinforce your understanding and use of the STL vector container and the Standard Template Library. Outcomes: Students successfully completing this assignment would master the following outcomes. Produce C++ class implementations given class declarations

VB房地产售楼管理系统(Access),比较实用-VB real estate sales management system (Access), more practical

数据结构课程设计文档！-data structure curriculum design document!

这是公交公司老年证发放管理软件，简单实用-This is the bus company old man card issuance management software, simple and practical

用VB写的和数据库联合编程的电子图档管理系统 -VB write joint programming and database of electronic document management system

清华大学数据结构课上实现的B+树，设计一个4阶B+树，包括： (1) 叶子的每个记录应该包括4字节（long）关键码值和60字节的数据字段(存储文件名等，可以自定)，设每个叶子可以存储5条记录，而内部节点应该是关键码值/指针对。此外，每个节点还应该有指向同层下一个节点的指针、本节点存储的关键码数等； (2) 此4阶B+树应该支持插入、删除以及根据给定关键码值进行精确检索与关键码范围检索； (3) 显示（打印）此4阶B+树的生长(含删除节点)过程实例；-Tsinghua University class data structure to achieve the B-tree, the design of a B-tree four bands, including : (a) the leaves of each record should include 4-byte (long) key code value and 60 gigabytes of data fields (document storage, etc., can be set), set up each leaf store five records, and internal nodes is the key code value/means against. In addition, each node should have the same point under a layer of the target node, the node storage key code number; (2) The B-tree four bands should support the insertion, deletion and with the given key code value accurate retrieval and key codes scope retrieval; (3) Display (Print ) This four bands B-tree growth (including the deletion of nodes) process examples;

中缀表达式到逆波兰式转换的程序代码,学习数据结构的可以-Infix expression to Reverse Polish conversion of program code, learning data structures can be

Generating next numbers in SQLServer should not be a problem. But problems arise when a customer asks for different types of next numbers that you cannot generate directly from SQL Server. This brief article describes how you would tackle this problem in different scenarios.