-
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
-
bTree
这是一个二叉树的工程文件,包括了工程文件里的所有文件。以及二叉树的构建,traverse,搜索等功能函数。(This file contains a summary of what you will find in each of the files that
make up your bTree application.
)
- 2011-05-20 08:12:04下载
- 积分: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
-
build_max_heap
最大堆排序算法,C++语言编写,原程序,算法导论(The maximum heap sort algorithm, C++ language)
- 2015-01-26 16:15:21下载
- 积分:1
-
migong
迷宫算法,1代表可以通过,0代表墙壁,自动找寻路线(Maze algorithm, 1 can pass 0 for the walls, automatically find routes)
- 2011-06-11 17:13:39下载
- 积分:1
-
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
-
2_24to2_28
双向链表 清华大学 出版社 《数据结构 C++》 源代码实现(Tsinghua University Press doubly linked list <data structure, C++> source code)
- 2011-02-05 22:08:53下载
- 积分:1
-
CEIA
POJ141的源代码,以空间换时间,速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)
- 2011-10-25 18:13:24下载
- 积分:1
-
ExchangeTree
先序创建二叉树,将二叉树所有节点的左右子树交换,再先序遍历输出(create a binary tree in first order, exchange all the nodes of the binary subtree , then preorder output)
- 2014-07-08 21:30:13下载
- 积分:1
-
function
提供字符串方法,大家面试可以用,包括找出对称字串(Some string function)
- 2011-05-14 23:14:49下载
- 积分:1