登录
首页 » Visual C++ » kaikuohaohebikuohaodepipei

kaikuohaohebikuohaodepipei

于 2009-04-13 发布 文件大小:31KB
0 194
下载积分: 1 下载次数: 2

代码说明:

  开括号和比括号的匹配,数据结构内容,很不错(More than brackets and brackets to open the match, the contents of data structure)

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

发表评论

0 个回复

  • Mult
    说明:  数据结构课上作业实现了一个多项式乘法的功能有注解(Job class data structure implements a polynomial function of multiplication comments)
    2011-03-20 20:28:31下载
    积分:1
  • astar
    A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values ​ ​ are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)
    2013-04-04 11:06:42下载
    积分:1
  • dd2
    自己用c语言写的一个模块化多电平最近电平调制排序的c程序,希望对大家有帮助(Own use c language written in a modular multi-level modulation level recently sort of c program, we hope to help)
    2014-05-21 20:19:49下载
    积分:1
  • ysph
    约瑟夫环,数据结构算法,挺有意思,看看,看看(ysphdfgfgf)
    2009-03-14 00:16:15下载
    积分:1
  • 最小生成树
    给定一个带权的无向连通图,如何选取一棵生成树,使树上所有边上权的总和为最小(Given a weighted undirected connected graph, how to select a spanning tree to minimize the sum of all the upper bounds on the tree)
    2017-06-05 17:27:17下载
    积分:1
  • list-and-array
    数组的定义与使用,数组的运算,字符串的输入与输出,冒泡排序(list and array)
    2013-10-17 11:32:30下载
    积分:1
  • CEIA
    POJ141的源代码,以空间换时间,速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)
    2011-10-25 18:13:24下载
    积分:1
  • binarytree
    二叉树的操作,涉及到三种顺序的遍历,树的凹入表示法,转化为一维数组储存,节点的计数,以及中序线索化。(Binary operation, involving three kinds of the order of traversal, tree concave representation into a one-dimensional array of storage, the node count, as well as in the threaded sequence.)
    2011-05-24 20:31:13下载
    积分:1
  • binary
    实现对二叉树的操作:建树、遍历、求层高、叶子数和结点数等(binary tree)
    2011-12-09 15:58:29下载
    积分: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
  • 696516资源总数
  • 106637会员总数
  • 8今日下载