-
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
-
fibonacci-heap
斐波那契堆是一种具有较好平摊时间的堆数据结构。我使用C语言来实现斐波那契堆。(Fibonacci heap is a heap of time with good flat data structure. I am using C language to implement Fibonacci heap.)
- 2013-09-17 18:02:59下载
- 积分:1
-
a-linked-list-and-related-processing
链表的建立及相关处理,包括排序,删除,初始化,增加,删除等等,且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through
)
- 2014-01-13 23:56:27下载
- 积分:1
-
Brute-force-algorithm
穷举算法,VC中的经典程序之一,适合初学者,(Brute-force algorithm, the the of the classic procedures in in the the VC, suitable for beginners)
- 2012-06-06 21:20:06下载
- 积分:1
-
tanxinfangfa
说明: 贪心方法是一种改进了的分级处理方法。它首先根据题意,选取一种量度标准。然后按这种量度标准对这n个输入排序,并按排序一次输入一个量。如果这个输入和当前已构成在这种量度意义下的部分最优解加在一起不能产生一个可行解,则不把此解输入加到这部分解中。这种能够得到某种度量意义下的最优解的分级处理方法称为贪心方法。(greedy method is an improvement of the classification methods. According to its first title Italy, and a selection of standards of measurement. Then, under such a standard measure of this sort n input, with an input an order volume. If the input current and constitutes a measure of significance in this part of the optimal solution together not produce a feasible solution. this solution will not put this added to the importation of decomposition. This can be a meaningful measure of the optimal solution hierarchical method, known as greedy method.)
- 2006-05-15 21:50:01下载
- 积分:1
-
quicksort
数据结构快速排序例程代码,只要按照例子就可以很容易加入到你的程序当中。(Data Structures quick sort routine code, just follow the example you can easily add them into your program.)
- 2013-05-23 15:05:53下载
- 积分:1
-
lujing
图的邻接表生成,深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)
- 2012-05-22 18:18:29下载
- 积分:1
-
DBSCAN
数据挖掘中聚类算发中基于密度的算法DBSCAN(Hair count data mining clustering algorithm DBSCAN density-based)
- 2011-09-29 09:53:45下载
- 积分:1
-
mapsearch
数据结构,关键路径问题,设计并实现关键路径的一种应用,采用图的算法(Data structure, critical path problem, using graph algorithm)
- 2016-01-09 17:34:45下载
- 积分:1
-
20070320list
包括链表的各项操作,添加、删除、修改等。还包括单项连标和双向链表。(including the operation, add, delete, revise. Also including individual targets and even two-way linked list.)
- 2007-03-20 10:39:42下载
- 积分:1