资源列表
wordproblem
- 输入一篇英文,程序将对里面每个单词的频率进行统计,从文件输入,而不是从键盘输入.-Enter an English, the program will be inside each word frequency statistics, from the file input, rather than from the keyboard input.
magic
- 用来求解任意阶幻方问题,对单偶幻方和双偶幻方都进行了求解.-Used to solve the problem of arbitrary order magic square, of single-dual doubly even magic squares and magic squares have been conducted to solve.
huafenn
- 整数划分问题的新解,按划分子式的个数,进行排列.-Integer division of the new solution, according to the number of designated molecular formula, to be ranked.
ffg
- 输入N位数,在其中插入R个乘号, 使得所得的结果最大.-Enter the N-digit, insert one of R at a multiplication sign, making the results of the largest.
Modbus_base_Hitech_and_C166
- 基于Hitech和C166的Modbus协议，通过优良的数据结构使得协议信息交互与数据的实际应用访问变得非常简单容易，当前版本支持人机常见的所有数据格式如（有/无符合）字节、字、浮点数，位，数组，等。并且提供有完善的代码注释，相信这必将是网上能够当到的最好Modbus源码！-Based on the Hitech and C166 of the Modbus protocol, through excellent protocol information data structure allow
kernel2.4.18_r1.1
- 自己根据lkd和情境分析，对kernel源码的核心模块的关键数据结构做的注释-Themselves in accordance with lkd and situational analysis, kernel-source core modules to do the key data structure of the Notes
BinarySearchTree
- 从键盘上输 入一串正整数， 最后输入－1作为输入结束的标志。如输入的序列为：2，5，7，23，48，96，……，-1。请以这些正整数的值作为二叉排序树中的结点的数据场之值，建立一棵二叉排序树。注意：请采用动态存储方法保存这棵二叉排序树，事先并未知道该二叉排序树中的结点的个数。-Input from the keyboard on a string of positive integers, the last input-1 as an input symbol of the end. Such
BinTree
- 请编写一个程序，确定二叉树的特征。如：每个节点的层次，从根到该节点的枝长（路径长度），子孙的个数及祖先的个数。每个节点在前序、中序、后序中的访问的序号。-Please write a procedure to determine the characteristics of binary tree. Such as: the level of each node from the root to the node of the branch length (path length), the n
hl1111111
- 这个题目主要内容是单链接表的应用。通过单链接表的数据结构方式储存多项式，并实现两多项式之间的乘法。-The main contents of the subject table are single-link applications. Through the single-link table data structure stored polynomial, and implementation between the two polynomial multiplication.
shiyan
- 实现了循环便利一棵树，查找叶子节点等功能！-Facilitate the implementation of the cycle of a tree, leaf nodes, such as search function!
Algorithm
- 上传试试看 不知道 是不是一定成功的-test