代码搜索：链表实现
找到约 10,000 项符合「链表实现」的源代码
代码结果 10,000
www.eeworm.com/read/426021/10293777
txt 求出平均分链表.txt
{
double av=0.0;
STREC *p=h->next;
while(p!=NULL)
{av=av+p->s;
p=p->next;
}
return av/N;
}
www.eeworm.com/read/425707/10335679
ppt 单链表的删除.ppt
www.eeworm.com/read/425707/10335684
ppt 双向链表的删除.ppt
www.eeworm.com/read/425707/10335725
ppt 单链表的复制.ppt
www.eeworm.com/read/159770/10618620
c 双链表正排序.c
#include
#include
#include
struct list{
int data;
struct list *next;
struct list *pre;
};
typedef struct list node;
typedef node *link;
link fr
www.eeworm.com/read/159770/10618622
c 建立链表1.c
/* 链表建立程序 */
#include"stdio.h"
#include
#define NULL 0
#define LEN sizeof(struct student)
struct student
{long num;
int score;
struct student *next;
};
int n; /*全局变量n*/
str
www.eeworm.com/read/159770/10618625
c 单链表倒序.c
#include
struct fsb
{
int data;
int flag;
struct fsb * next;
};
main()
{
struct fsb *p,*head,*sta,*end;
int i,cishu,j;
end=(struct fsb *)malloc(sizeof(struct fsb))
www.eeworm.com/read/159770/10618626
c 单链表1.c
#include
#include
struct roommate
{
char name;
long num;
int age;
char birthplace;
struct roommate *next;
};
struct roommate *head,*cthis,*cnew;
void ins_record(void)
www.eeworm.com/read/159770/10618629
c 单链表2.c
#include
#include
struct node{
int key;
struct node *next;
};
void creat_link(struct node *);
main()
{
struct node *head=NULL;
creat_li
www.eeworm.com/read/276181/10758443
c 双链表正排序.c
#include
#include
#include
struct list{
int data;
struct list *next;
struct list *pre;
};
typedef struct list node;
typedef node *link;
link fr