登录
首页 » Visual C++ » main

main

于 2016-03-29 发布 文件大小:2926KB
0 235
下载积分: 1 下载次数: 2

代码说明:

  求最长上升下降\非上升非下降的刷表法(Seeking maximum rise fall Philippines rise fall Philippines brush table method)

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

发表评论

0 个回复

  • Nqueen
    n皇后问题构造法实现,比起启发式修补运行时间较长。(n Queen realize the issue of construction method, compared to a longer run-time heuristic repair.)
    2008-05-16 12:45:32下载
    积分:1
  • baiji
    百鸡算法是一种简单的逻辑算法,通过不同的鸡不同的价钱,得出大鸡小鸡的个数(Typical code for white chicken algorithm)
    2012-06-02 16:31:30下载
    积分:1
  • 001
    二叉树的中序遍历,先序遍历以及后序遍历的算法(Binary tree in preorder traversal, preorder traversal and postorder traversal algorithm)
    2012-06-03 23:26:44下载
    积分:1
  • maze
    实现经典问题老鼠迷宫,并用坐标将路径显示出来(Achieve classic problem rat maze, and coordinate with the path displayed)
    2016-05-25 22:56:59下载
    积分:1
  • Graph
    数据结构中图的遍历Data structure traversal of center(Data structure traversal of center)
    2013-11-28 10:53:29下载
    积分:1
  • maze
    迷宫求解一般采用“穷举法”,逐一沿顺时针方向查找相邻块(一共四块-东(右)、南(下),西(左)、北(上))是否可通,即该相邻块既是通道块,且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)
    2013-12-13 17:55:45下载
    积分:1
  • heap
    实现栈的基本操作,建栈,进栈,出栈,数据结构实现(To achieve the basic operation of the stack, built stack into the stack, the stack data structure)
    2013-04-03 11:08:37下载
    积分:1
  • bag1
    使用不同的方法解决背包问题:本算法采用的是动态规划方法,比较好的解决背包问题。(Use different methods to solve knapsack problem: The algorithm is a dynamic programming approach, a better solution to knapsack problem.)
    2011-07-16 18:40:31下载
    积分:1
  • Huffman-Tree
    使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率,并据此构造Huffman树,编制Huffman 码;根据已经得到的编码,对01形式的编码段进行译码。 具体的要求: 1.将给定字符文件编码,生成编码,输出每个字符出现的次数和编码; 2.将给定编码文件译码,生成字符,输出编码及其对应字符。 (Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding. Specific requirements: 1 coding the given character file, generating the encoding, and outputting the number and encoding of each character 2 will be given the encoding file decoding, generating the character, the output code and its corresponding character.)
    2015-05-22 15:37:03下载
    积分:1
  • migong---cPP
    迷宫问题C++代码。。。解决迷宫问题。。。。(Maze C++ code. . . Solve maze problems. . . .)
    2011-11-03 22:28:30下载
    积分:1
  • 696516资源总数
  • 106579会员总数
  • 0今日下载