数据结构哈夫曼实习报告

数据结构1800例题与答案 我想对大学生很有用啊-data structure with 1,800 examples, I would like to answer students useful ah

好用的仓库管理系统-user-friendly Warehouse Management System

jdbc连接db2范例,非常完整,我找了很久,供学习参考-jdbc connecting db2 example, the very integrity, I look for a long time for study reference

最长公共子串问题-longest public substrings problems

迷宫求解问题。程序中已经建好了一个数组作为迷宫数组。然后进行试探，输出迷宫从起点到终点的路径。-Maze solving the problem. The program has been built as a maze of an array of arrays. And then test the output from the beginning to the end of the maze path.

问题描述：设有11种不问的钱币各若干张，可用这II种钱币产生许多不同的面值。试 设计一个算法，计算给定的某个面值，能有多少种不同的产生方法。例如有1分3张，2分 3张，5分1张，则能组成7分面值的方法有：3个1分+2个2分，1个1分十3个2分，2 个1分+1个5分，1个2分+1个5分共四种。 ^编程任务：对于给定的II种不同钱币，编程计算某个给定面值能有多少种不同的产生 方法。-Problem Description: There should be 11 kinds of coins did not ask the number of beds available this II produced many different kinds of coin denominations. Try to design an algorithm to calculate a nominal value of a given that there can be many different returned. For instance, a sub-3, 2 points 3, 5 min 1, then can be composed of seven sub-par methods are: 3 1 min+2 2 points, a 1 minute 10 3 2 points, 2 1 points+1 5 points, a 2 min+1 5 minutes of four kinds. ^ Programming task: for a given II different coins, the calculation of a given program can have many different denominations is returned.

由于计算机存储的限制，当其所存储的数大于32位时，就会有溢出，该程序只要是实现大数加法 减法 乘法。-computer storage limitations, when it stored more than 32 a few hours, there will be a spillover, The procedure is as long as the majority addition subtraction multiplication.

求乘积最大的子序列乘积,采用动态规划方法求解-product for the greatest sequences product using dynamic programming method for

将两个随机产生的链表连接,并按从小到大的顺序输出-two randomly generated Chain Link, together with a small to large export order

用DELPHI编写的学生管理信息系统，可以实现基本的信息功能。是编来用来交作业的。-used to prepare students Delphi management information system that can achieve basic information functions. To be allocated to the perpendicular operation.