代码搜索：链表实现
找到约 10,000 项符合「链表实现」的源代码
代码结果 10,000
www.eeworm.com/read/165890/10047818
cpp 双链表删除.cpp
#include
#include
//双链表的定义：
typedef char DataType;
typedef struct dlistnode //结点类型定义
{ DataType data;
struct dlistnode *prior,*next;
}DListNode;
typedef DListNode *DLinkL
www.eeworm.com/read/165890/10047843
cpp 单链表插入.cpp
#include
#include
//单链表的定义：
typedef char DataType; //DataType可以是任何相应的数据类型如int, float或char
typedef struct node //结点类型定义
{ DataType data; //结点的数据域
struct node *next; //
www.eeworm.com/read/165890/10047876
cpp 单链表删除.cpp
#include
#include
//单链表的定义：
typedef char DataType; //DataType可以是任何相应的数据类型如int, float或char
typedef struct node //结点类型定义
{ DataType data; //结点的数据域
struct node *next; //
www.eeworm.com/read/159949/10584784
doc 单链表应用.doc
www.eeworm.com/read/277527/10629713
cpp 链表转置.cpp
#include
using namespace std;
#include
struct Lnode
{
int data;
Lnode *next;
};
Lnode *CreateList(int n)//创建链表
{
int a,i;
Lnode *h,*p;
h=NULL;
cout
www.eeworm.com/read/276181/10758591
c 单循环链表.c
# define null 0
typedef char ElemType;
typedef struct Circular
{
ElemType data;
struct LNode *next;
};
setnull(struct Circular **p)
{
*p=null;
}
int length (struct Circular **p)
{
www.eeworm.com/read/418460/10944575
txt 链表2.txt
#include
#include
#include
#define LEN sizeof(struct num )
struct num
{
int data;
struct num*next;
};
struct num *create(int n)
{
//struct num*
www.eeworm.com/read/467321/7009684
cpp 作业单链表.cpp
#include
#include
#define OK 1
#define ERROR 0
#define NULL 0
typedef int ElemType;
typedef int Status;
typedef struct Node {
ElemType data; // 数据域
str
www.eeworm.com/read/463983/7171129
cpp 矩阵到链表.cpp
#include"jb.h"
void travgraph(adjlist g,int n);
void jtol(adjmax adj,int n);
void main()
{
int i,j,k,n,e;
char b,t;
adjmax adj;
printf("输入顶点数(n)和边数(e): ");
scanf("%d%d",&n,&e);
fo
www.eeworm.com/read/463983/7171135