登录
首页 » Visual C++ » link

link

于 2013-05-01 发布 文件大小:1KB
0 97
下载积分: 1 下载次数: 1

代码说明:

  实现链表的一些操作,方便进行遍历,查找等程序(Operation, convenient linked list traversal, the search procedure)

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

发表评论

0 个回复

  • 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
  • 8queen
    此程序用于解决8皇后问题,运行后输出8皇后问题的所有解(This program is used to solve the 8 queens problem, all solutions of 8 queens problem output operation.)
    2013-05-06 21:15:23下载
    积分:1
  • ds3
    单向链表的创建与操作 设单向链表中节点的数据域的数据类型为整型,编写函数实现以下操作: (1)实现单向链表的创建(包括初始化)与输出操作,节点的个数及节点的数据由用户输入。 (源代码:ds3-1.c) (2)查找给定的单链表中的第i个节点,并将其地址返回。若不存在第i个节点,则返回空地址。 (源代码:ds3-2.c) (3)查找给定的单链表中值为n的节点,并将其地址返回。若不存在值为n的节点,则返回空地址。同时,还应通过参数传回该节点的序号。 (源代码:ds3-3.c) (4)删除给定的单链表中的第i个节点,成功返回1,失败返回0。 (源代码:ds3-4.c) (5)删除给定的单链表中值为n的节点,成功返回1,失败返回0。 (源代码:ds3-5.c) (6)在给定的单链表的第i位上插入值为n的节点。 (源代码:ds3-6.c) (7)在给定单链表的值为m的节点的前面插入一个值为n的节点。 (源代码:ds3-7.c) (Creation and operation of a one-way linked list Set up a one-way linked list data type node integer data fields , write a function to achieve the following: ( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user . ( Source : ds3-1.c) ( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address. ( Source : ds3-2.c) ( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node . ( Source : ds3-3.c) ( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 . ( Source : ds3-4.c) ( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 . ( Source : ds3-5.c) ( 6 ) )
    2014-05-11 19:19:41下载
    积分:1
  • work_std
    工作时单元功能实现的部分资料 主要涉及字符串处理、排序算法,字符串查询、kmp、改进二分法、Unicode编码、uniq(functional modules work to achieve some of the information involved mainly string handling, sorting algorithm, string inquiries, kmp improve dichotomy, Unicode encoding, uniq)
    2007-01-23 08:57:38下载
    积分:1
  • shopping-question
    实现超市中排队购物用时最短,是计算机算法设计与分析中的一道题。自己写的程序,原创!(Achieve queued supermarket shopping with the shortest, is a question in the design and analysis of computer algorithms. Write their own procedures, original!)
    2012-08-18 11:01:09下载
    积分:1
  • mathandos
    算法设计的动态规划,贪心算法 操作系统的银行家算法等五个小程序(data)
    2009-12-27 17:06:43下载
    积分:1
  • Binary-Tree-Sort
    二叉树排序,二叉树的递归调用排序,属于C语言源码(Binary Tree Sort)
    2011-09-01 10:14:24下载
    积分:1
  • QUICKSORT
    用C语言实现的普通快速排序,和随机快速排序进行对比(With ordinary C language implementation of quick sort, quick sort and compare the random)
    2015-01-12 15:00:00下载
    积分:1
  • Kruskal
    克鲁斯卡尔算法思想.cpp int seekedge(EDGE * (&a), int n) void bubble(EDGE * (&a), int size) void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针,a2是最小生成树边集的头指针,k为所要删的边 void storepicture(EDGE * (&a), int n, VERTEX *b, int m) (Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m) )
    2009-06-27 01:43:39下载
    积分:1
  • jhgrerfgjz
    一个简单的求矩阵求逆的c语言算法 一个简单的求矩阵求逆的c语言算法 一个简单的求矩阵求逆的c语言算法(a simple matrix inversion for the C language algorithms for a simple matrix inversion of the c language a simple algorithm The matrix inversion for the C language algorithms for a simple matrix inversion algorithm in C Language)
    2021-03-29 11:39:11下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载