登录
首页 » Visual C++ » Tetris

Tetris

于 2013-03-27 发布 文件大小:4483KB
0 295
下载积分: 1 下载次数: 1

代码说明:

  使用很好的数据结构,程序运行效率高,界面简洁美观。(Good data structure, high efficiency, simple and beautiful interface.)

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

发表评论

0 个回复

  • mataqipan
    马踏棋盘的贪心算法,8*8棋盘,基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)
    2006-05-30 20:05:17下载
    积分:1
  • b
    说明:  定义一个类SortArray继承自MyArray,在该类中定义函数sort实现排序功能。 定义一个类ReArray继承自MyArray,在该类中定义函数reverse实现逆转功能。 定义一个类AverArray继承自MyArray,在该类中定义函数Aver实现求解整数的平均值。 定义NewArray类,同时继承了SortArray、ReArray和AverArray,使得NewArray类的对象同时具有排序、逆转和求平均值的功能。在继承的过程中声明为虚基类,体会虚基类在解决二义性问题中的作用。 (Define a class SortArray inherited from MyArray, defined in the class sorting function sort implementation. Define a class ReArray inherited from MyArray, define the function in reverse to achieve such reversal function. Define a class AverArray inherited from MyArray, defined in the class to solve integer function Aver achieve the average. Defined NewArray class, and inherits SortArray, ReArray and AverArray, making the object of both NewArray class sorting, reversing, and the mean value of the function. In the process of succession declared as virtual base classes, virtual base class experience in resolving ambiguities of the role.)
    2010-06-02 02:13:03下载
    积分:1
  • prim
    普利姆算法用来求解最小生成树问题很容易,使得树的最小权值最小。(Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree)
    2012-05-17 09:11:15下载
    积分:1
  • zhebanchazhao
    实现折半查找,非递归形式,从而实现数据结构所要的结果。(To achieve binary search, the non-recursive form)
    2012-08-29 12:35:25下载
    积分:1
  • ahuangCD
    这个是数据结构课程设计中阿黄的CD的程序代码的工程文件包(This is a data structure curriculum design A yellow CD program code works package)
    2013-12-21 18:53:00下载
    积分:1
  • Huffman
    数据结构,利用霍夫曼树实现文本数据的压缩。(Huffman data compression and decompression.)
    2014-01-28 18:25:24下载
    积分:1
  • Insert
    POJ 字符串的插入 可以将一定长度的字符串插入之前给出的字符串之中(POJ string can be inserted into a length of string into a string before being given)
    2013-11-21 23:27:17下载
    积分:1
  • deep-copy
    该代码实现了深拷贝的问题,对于深拷贝进行了一系列的介绍,并且显示其与浅拷贝的区别。(A deep copy of the code issues a series of deep copy for presentation, and shows the difference between a shallow copy.)
    2014-01-03 10:46:48下载
    积分:1
  • Lecture6
    数据结构中链式队列和堆栈的循环用法,非常有用(Queue data structure in the chain and the cycle stack usage, very useful)
    2011-07-27 15:30:29下载
    积分:1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载