搜索资源列表
Love_You
- 用来向你喜欢的女孩子表达你内心深刻的爱意的一段程序-Do you like the girls used to express your love deep inside a section of program
hafuman
- 哈夫曼编码为实现哈夫曼编码，先构造哈夫曼树。哈夫曼树的每个节点都存有该节点的信源符号，概率，双亲节点，左孩子节点和右孩子节点。每个节点的概率为该节点左孩子节点和右孩子节点的概率之和。每次选取概率最小的两个节点作为左右孩子节点，直到把所有的数据都整合到哈夫曼树中。每个原始数据都处于叶子节点的位置。-Huffman coding Huffman coding to achieve the first Huffman tree structure. Huffman tree for each node
jingyinbook
- 我不是IT精英，IT类的网络小说，非常好看，从汇编成长的孩子。-I am not the elite IT, IT classes online novel, very nice, from the compilation of the growth of children.
renkouyuce
- 现有10对25岁男女结婚，他们25岁来时生育孩子，每对夫妻可以有四个和孩子，每5年生一个孩子。如果人均寿命70岁，100年共有多少人？- Existing 10 to 25 years of age, married, 25 years old to when they have children, each couple can have four, and children, one child every five years. If the average life expecta
HuffmanTree
- 根据哈夫曼算法，建立哈夫曼树时，可以将哈夫曼树定义为一个结构型的一维数组HuffTree，保存哈夫曼树中各结点的信息，每个结点包括：权值、左孩子、右孩子、双亲-Huffman algorithm Huffman tree is created, the Huffman tree is defined as a structure of one-dimensional array HuffTree, save the information of Huffman tree nodes, each
sqwsdqd
- 微机接口原理，很好的学习资料，喜欢的孩子可以好好学习-Computer interface principles, good learning materials, like the children can learn
jiapu
- 家谱的操作，可以查询某人的孩子与父亲，与文件操作-The genealogy of the operation, you can inquire about someone' s child with his father, and file operations
tree
- 树的相关操作，先序遍历建立二叉链表，左右孩子交换，二叉树中叶子节点个数算法，统计以值为x的结点为根的子树中叶子结点的数目，按树状打印二叉树-Tree-related operations, first traversal establishment of binary list, so the child exchange, the number of leaf nodes in a binary tree algorithm, the statistical value of x to a n