网站首页

登录

ds3

于 2014-05-11 发布文件大小:6KB

 0  219

下载积分: 1 下载次数: 3

我要下载

代码说明：

单向链表的创建与操作设单向链表中节点的数据域的数据类型为整型，编写函数实现以下操作：（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 ) )

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

zuiyouerfenjiansuozhu
最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)

2013-10-10 18:48:17下载

积分：1
mofanwenti
魔方问题数据结构使用c++ 经典问题(Cube problem Data Structure Using c++ Classic problem)

2014-01-08 22:30:48下载

积分：1
约瑟夫环的循环链表实现
约瑟夫环的循环链表实现，这个程序比较完整，有需要做试验的请速速下载。(Josephus cycle Chain achieved, the procedure is complete, the pilot needs to be done urgently requested to download.)

2005-07-03 19:38:38下载

积分：1
0712233
数据结构c语言版，图的遍历，周游世界，无向图的遍历，包含14个国家。(Data structure c language version, graph traversal, travel around the world, undirected graph traversal, including 14 countries.)

2009-12-20 17:04:09下载

积分：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
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
yuesefuhuan
使用VC编写的约瑟夫环程序，简单明了，方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)

2009-09-08 16:45:26下载

积分：1
exchange
这是一个二叉树左右子树交换的简单程序，希望对大家有用！(This is a binary tree so the simple sub-tree exchange procedures in the hope for all of us!)

2009-10-16 21:02:19下载

积分：1
josephus
通过c语言数组算法解决josephus问题，m个人围成一圈，从第一个小孩开始顺时针方向每数到第n个小孩时这个小孩离开，最后剩下的小孩是胜利者。求第几个小孩为胜利者(C language array algorithm to solve the Josephus problem, m individual circle, from the first child began to count clockwise every n children, the child left, and finally the remaining child is the winner. A few kids for victory)

2017-11-12 10:30:06下载

积分：1
2.2
已知线性表中的元素以值递增有序排列，并以单链表作存储结构。试写一高效的算法，删除表中所有值大于mink且小于maxk的元素（若表中存在这样的元素）同时释放被删结点空间，并分析你的算法的时间复杂度（注意：mink和maxk是给定的两个参变量，它们的值可以和表中的元素相同，也可以不同）。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values and elements in the table can be the same or different).)

2015-04-11 23:11:41下载

积分：1

696516资源总数
106914会员总数
0今日下载