2007327

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

数据结构中的一元多项式相加，多于考研算法实现很重要。后续部分将在后期上传！(The sum of Multinomial)

链表的建立及相关处理，包括排序，删除，初始化，增加，删除等等，且程序已运行通过。(The establishment of a linked list and related processing, including sorting, delete, initialization, increase, delete, etc., and the program has been run through )

参加数学建模的同学很可能会遇到这套题。本程序采用链表进行编写，很方便地解决了小白鼠问题。(Mathematical modeling of the students participating are likely to encounter this question, the program uses the list to solve the problem of mice, very convenient.)

单循环链表，用C++实现 提供入队，出队，判断空等方法(Single cycle linked list, with C++ into the team, the team judge waited in vain for methods)

数据结构课程设计－－实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)

PRIM算法 对任意给定的网和起点，用PRIM算法的基本思想求解出所有的最小生成树。(PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree.)

选择型结构c语言编程 (Choose the type of structure of C language programming)

键盘任意输入一组字母或数字生成无序数组，对数组按ASCII顺序进行排序（排序要求至少用两种排序算法），再从键盘输入一个值进行二分查找，返回查找成功或者失败的信息(Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sorting algorithms from the keyboard input a value dichotomy, returns to find success or failure of the information)

用从语言实现飞机订票系统。程序中用到了数据结构中的队列和栈。(From the language used airline reservation system. Process the data structure used in the queue and stack.)