源代码，是java实现的，比较清晰，具体自己看

描述 问题描述： 给定一个只包含数字[0..9]的字符串，求使用字符串中的某些字符，构建一个能够整除15的最大的整数。 注意，字符串中的每个字符只能使用一次。 编程任务： 求由给定字符串构建的能够整除15的最大整数。-Description of the problem description: Given a contain only numbers [0 .. 9] of the string, seeking to use some of the characters in the string, one can build the largest integer divisible by 15. Note that the string for each character can only be used once. Programming task: seeking from the given string that can build the largest integer divisible by 15.

pgc 解调算法的c 语言实现，有详细的说明和注释。-PGC demodulation algorithm c language, has detailed instructions and notes.

这是用数据库语言编写的仓库管理系统-This is the database used to prepare the language Warehouse Management System

飞机场模拟系统，，使用了栈和队列的知识，，是学习数据结构时做的，，大家不妨学习一下-Airport simulation system, the use of the stack and queue knowledge, is a data structure of learning to do, and, we may as well learn about

it数据挖掘项目这里采用分类聚类算法，hm那里采用k均值和模糊c均值提出算法，c4.5 ans see 5算法我们在本项目工作中采用，

用VB6.0实现的最短路径分析，采用了优化的方法（搜索方向一致性）-Using VB6.0 to achieve the shortest path analysis, using optimization methods (search direction consistency)

做的非常好的论坛，数据库采用access。数据库在db文件夹下，在odbc注册db2000为系统DSN，就可以使用了-To do a very good forum, the database used access. Database in the db folder, db2000 for registration in the odbc system DSN, you can use the

数据结构：用链表做存储结构求两个一元多项式相加的结果-Data structures: The linked list storage structure seeking to do two one dollar sum of the results of polynomial

本程序使用Visual C++6.0编写，使用了MFC，数据库用的是SQL Server，要正常运行本程序，请安装该数据库，并参看压缩文件中的DBConfig.ini文件。本程序如果和已经上传的NetControlManager已经完全可以满足用户对局域网控制的需求，特色功能包括：登陆认证、局域网内特定IP上网限制等-This procedure using Visual C++ 6.0 preparation, the use of the MFC, the database used is SQL Server, to the normal operation of this program, please install the database and see the compressed file in the document DBConfig.ini. This procedure has been uploaded If NetControlManager has been fully able to meet user demand for LAN control, features include: login authentication, LAN specific IP access restrictions

1.[问题描述] 编写递归算法，计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。 程序如下： #include #include #include"stdlib.h" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right af