资源列表
[数据结构常用算法] insertstring
说明:假设以块链结构(block linked)表示串,试编写将串S插入到串T某个字符之后的算法,若该字符不存在,则将串S联接在串T之后-Which means that the string is assumed to block chain structure (Block linked), try to write the string S is inserted into a character string T algorithm, if the character does not exi<ljy> 在 2025-07-06 上传 | 大小:1kb | 下载:0
[数据结构常用算法] expression
说明:表达式求值 对于一个算法表达式求最终结果 运用了栈等-Expression for the value of the final results of the use of an algorithm expression and stack<mm> 在 2025-07-06 上传 | 大小:1kb | 下载:0
[数据结构常用算法] dijstla-(2)
说明:数据结构中用邻接矩阵实现的迪杰斯特拉最短路径的路径输出-Data structure using adjacency matrix of the Dijkstra shortest path path output<马明> 在 2025-07-06 上传 | 大小:1kb | 下载:0
[数据结构常用算法] BT
说明:code for binary tree A binary tree is a tree data structure in which each node has at most two child nodes, usually distinguished as "left" and "right". Nodes with children are parent nodes, and child nodes may contain references to their parents.<subodh> 在 2025-07-06 上传 | 大小:1kb | 下载:0
[数据结构常用算法] ToH
说明:The Tower of Hanoi (also called the Tower of Brahma or Lucas Tower,[1] and sometimes pluralised) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts wit<subodh> 在 2025-07-06 上传 | 大小:1kb | 下载:0
[数据结构常用算法] stack1
说明:a stack is a particular kind of abstract data type or collection in which the principal (or only) operations on the collection are the addition of an entity to the collection, known as push and removal of an entity, known as pop.[1] The relation betw<subodh> 在 2025-07-06 上传 | 大小:1kb | 下载:0
[数据结构常用算法] DoubleLinkedList
说明:java描述的双链表,可以向前向后遍历,-java described doubly linked list, forward and backward traversal<李强> 在 2025-07-06 上传 | 大小:1kb | 下载:0