sf22带头结点的单链表，可以删除添加数据。C++-sf22 lead single node chain and the addition of data can be deleted. C 下载
|
建立带表头结点的单链表，打印所有结点的数据域；输入一个值，若某个结点的数据域为该值，则在其后插入另一个新结点，若无此结点，则在表尾插入新结点，然后打印；给一个值，删除结点的数据域是该值的所有结点，然后打印。（表生成时可用前插法或后插法）-table with the establishment of the first node of a single linked list, print all nodes of the data domain; An input value, If a nodes data fields for the values, and subsequently inserted in a new node, in the absence of such nodes, at the end of the insertion of a new form nodes, then Print; to a value of the node to delete data domain is the value of all the nodes, then Print. (Table Generation available houses or after interpolation) 下载
|
带头结点的双向链表算法讨论.pdf 学数据结构必看-lead in the two-way node chain algorithm discussed. Pdf data structure watched every game 下载
|
定义并实现带头结点的循环双向链表类，除构造和析构函数外，成员函数还有取数据元素个数、插入、删除、取数据元素-definition and take the lead in achieving the cycle node type two-way linked list, in addition to the structural and destructor function, members also function from the number of data elements, insert, delete, extract the data elements 下载
|
用C语言编写的带头结点的双链循环线性表。。。-C language prepared by the lead node cycle linear double-stranded form. . . 下载
|
带头结点双链循环线性表，数据结构的常用经典算法-lead node cycle linear double-stranded form, the data structure used classical algorithm 下载
|
采用带头结点的约瑟夫算法，存储结构采用单链表结构，无bug-using lead node Joseph algorithm, a single storage structure Chain structure, no bug 下载
|
按照数据结构书编的程序,编译出来完事的,能运行的"逆置带头结点的动态单链表L"-book series of the process, get away from the compiler can run the "reverse home lead the dynamic node L-List" 下载
|
编写程序，实现有序链表的建立；并实现对两个有序链表的归并操作，主要实验内容如下： 1. 定义链表的数据类型（带有头结点）； 2. 实现链表的基本操作：初始化、销毁、有序插入； 3. 通过键盘输入建立一个非递减有序链表（键盘输入不一定按照非递减的顺序） 4. 对通过键盘输入而建立好的两个非递减有序链表进行归并操作，并将归并好的有序链表输出。（需要编写一个归并函数） -preparation procedures, the establishment of an orderly chain; And to achieve an orderly chain of the two merging operations, the main contents are as follows : 1. Listless definition of the data types (with the first node); 2. Listless achieve the basic operation : initialization, destruction, orderly inserted; 3. Keyboard input through the establishment of a non-regressive and orderly chain (not necessarily in accordance with the keyboard input-in descending order) 4. right links Guo keyboard input and two well-established non-regressive orderly list was merging operation and merge good and orderly chain output. (Need to prepare a merge function) 下载
|
一元稀疏多项式计算器[加法和乘法] 问题描述： 设计一元系数多项式计数器实现两个多项式间的加法、减法。 基本要求： （1） 输入并建立多项式 （2） 输出多项式，输出形式为整数序列：n，c1，e1，c2，e2……cn，en，其中n是多项式的项数，ci，ei分别为第i项的系数和指数。序列按指数降序排列。 （3） 多项式a和b相加，建立多项式a+b，输出相加的多项式。 （4） 多项式a和b相减，建立多项式a-b，输出相减的多项式。 用带表头结点的单链表存储多项式。 测试数据： (1) (2x+5x8-3.1x11)+(7-5x8+11x9) (2) (6x-3-x+4.4x2-1.2x9)-(-6x-3+5.4x2+7.8x15) (3) (x+x2+x3)+0 (4) (x+x3)-(-x-x-3) -one yuan sparse polynomial calculator [Addition and multiplication] Problem description : Design one yuan polynomial coefficient counter achieve the two polynomials addition, subtraction. Basic requirements : (a) input and the establishment of polynomial (2) output polynomial, the output form of integer sequence : n, c1, e1, c2, e2 ... cn, en, where n is the polynomial Number, ci, ei for the first item i the coefficients and indexes. By sequencing index in descending order. (3) a and b polynomial addition, the establishment of a polynomial b, the combined output polynomial. (4) a and b polynomial subtraction, the establishment of a polynomial-b, the output phase by polynomials. With the first table with a single node Chain store polynomial. Test data : (1) (2x 5x8 - 3.1x11) (7-5x8 swath) ( 下载
|