代码搜索:链表实现

找到约 10,000 项符合「链表实现」的源代码

代码结果 10,000
www.eeworm.com/read/278532/10528553

cpp 线形链表.cpp

#include #include #define MAXSIZE 100 //线性表可能达到的最大长度 #define ERROR 0 #define OK 1 typedef struct Node /* 结点类型定义 */ { int data; struct Node *next; }Node, *LinkL
www.eeworm.com/read/159949/10584760

doc 循环链表.doc

www.eeworm.com/read/159949/10584778

doc 单链表.doc

www.eeworm.com/read/159949/10584789

doc 双向链表.doc

www.eeworm.com/read/159770/10618624

c 单链表.c

#include #include struct roommate { char name[20]; long num; int age; char birthplace[20]; struct roommate *next; }; struct roommate *head,*cthis,*cnew; void
www.eeworm.com/read/159770/10618628

c 链表(递归).c

#include #include struct listNode{ int data; struct listNode *nextPtr; }; typedef struct listNode LISTNODE; typedef LISTNODE * LISTNODEPTR; LISTNODEPTR list(LISTNODEPTR , int); /
www.eeworm.com/read/277527/10629717

cpp 链表插入.cpp

#include using namespace std; #include typedef int DataType; //以int为例 struct Lnode { DataType data; Lnode *next; }; Lnode *insert(Lnode *p,int n)//链表插入 {
www.eeworm.com/read/277527/10629722

cpp 链表删除.cpp

#include using namespace std; #include struct Lnode { int len; double data; Lnode *next; }; Lnode *creatlnode()//创建链表 { Lnode *h,*p,*q; int n=0; h=NULL; cou
www.eeworm.com/read/158804/10728585

opt 双向链表.opt

www.eeworm.com/read/158804/10728588

dsw 双向链表.dsw

Microsoft Developer Studio Workspace File, Format Version 6.00 # WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE! ###############################################################################