代码搜索:链表实现

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

代码结果 10,000
www.eeworm.com/read/376627/9311500

c 单链表.c

/*单链表的各种操作*/ # define null 0 typedef char ElemType; /* 字符型数据*/ typedef struct LNode { ElemType data; struct LNode *next; }; setnull(struct LNode **p); int length (struct LNode **p
www.eeworm.com/read/376627/9311705

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/376627/9311719

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/376574/9313528

txt 链表例子.txt

附件 /********************************************************************* * * Filename: pfile.c * Version: 1.0 * Description: Demo for Linux LIST utility * Com
www.eeworm.com/read/375384/9362150

txt 链表遍历.txt

#include #include struct LNode{ char elem; struct LNode* next; }*l,*p,*v; void Sequence(struct LNode * l, int n) { int i;char swap,*e,*f; for(i=1;i
www.eeworm.com/read/363342/9958041

c 单链表.c

/*单链表的各种操作*/ # define null 0 typedef char ElemType; /* 字符型数据*/ typedef struct LNode { ElemType data; struct LNode *next; }; setnull(struct LNode **p); int length (struct LNode **p
www.eeworm.com/read/363342/9958197

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/363342/9958205

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/167125/9980243

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/167125/9980251

c 链表(递归).c

#include #include struct listNode{ int data; struct listNode *nextPtr; }; typedef struct listNode LISTNODE; typedef LISTNODE * LISTNODEPTR; LISTNODEPTR list(LISTNODEPTR , int); /