登录
首页 » Visual C++ » the-dynamic-planning

the-dynamic-planning

于 2011-12-15 发布 文件大小:59KB
0 280
下载积分: 1 下载次数: 3

代码说明:

  本文讨论了动态规划这一思想的核心内容和其基本特点,探讨了动态规划思想的适用范围,动态规划子问题空间和递推关系式确立的一般思路。(This paper discusses the dynamic planning this thought core content and its basic characteristics, this paper discusses the dynamic planning idea, the applicable scope of the dynamic programming problem space and son recursive formula of the establishment of general thoughts. )

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 插入排序
    说明:  根据所选定的字符顺序,按照从大到小的规则,对字符进行插入排序,(Insert and sort characters)
    2020-06-22 12:40:01下载
    积分:1
  • HuffanCoding
    读取数据,统计所得到的文件中每个字母的权值,创建哈夫曼树,哈夫曼编码。哈夫曼解码,解码后内容写入到指定的文件。 读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组,最终可以得到一个存放目标文件内容的数组。 将得到的数组进行字母权值的统计,统计每个字母出现的次数,次数即为每个字母的权值。 将得到的字符数组与权值数组作为创建哈夫曼树的依据,哈夫曼树根据每个字母权值的大小来创建,每个节点,包括权值、父节点、左子、右子和字母本身。 根据哈夫曼树进行编码。形成目标文件的哈夫曼编码,将此编码返回。 根据哈夫曼树得到的数组即为解码数组,解码数组作为解码的结果返回。 写入输出文件,将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入,将数组写入到相应的文件中。 (Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file. Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array. The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter. The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself. According to Huffman coding. The formation of the target file Huffman coding, this code returns. According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)
    2020-07-02 15:40:01下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • Sort
    排序,各种排序算法,插入排序,冒泡排序,快速排序,等等!(Sorting, various sorting algorithms, insertion sort, bubble sort, quick sort, and more!)
    2011-05-08 00:09:13下载
    积分:1
  • lianbiao
    用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)
    2011-10-13 23:06:55下载
    积分:1
  • Prim
    编程实现Prim算法,基于最小堆数据结构,生成最小代价生成树。 (其中随机生成点和边,形成连通图) 根据输入的顶点数的不同,分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for given size n according to the following approach: 1) Randomly generate n points ( ) on a plane 2) Randomly generate k pairs of points as edges of the graph. 3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge. )
    2011-06-11 16:28:53下载
    积分:1
  • 12
    说明:  哈希表,用c++语言编写,可操作运行,结果正确(Hash table, using c++ language, operational run, the results are correct)
    2011-05-06 14:42:14下载
    积分:1
  • Birch
    这是birch C语言的源代码。里面有详细的代码注释方便学习birch算法(birch c)
    2012-05-08 09:00:44下载
    积分:1
  • crox
    矩形件最优排样的程序,用Visual C编写,在6.0下能正常运行。(Rectangular pieces Optimal Nesting program)
    2013-05-13 14:31:41下载
    积分:1
  • neu_SSD
    东北大学数据结构实验指导书,2014级东北大学软件学院软件工程专业(Experimental data structure, guide books, Northeastern University, Northeastern University School of Software 2014 Software Engineering)
    2016-06-30 16:12:38下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载