代码搜索：链表实现
找到约 10,000 项符合「链表实现」的源代码
代码结果 10,000
www.eeworm.com/read/327073/13100563
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/139802/13129992
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/139802/13130088
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/139802/13130100
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/139802/13130108
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/139802/13130119
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/326053/13169071
cpp 程序15.1：单链表.cpp
/******程序15.1：单链表.cpp******/
#include
#include
using namespace std;
class Information
{
private:
string sName; //姓名
string sPhone; //电话
string sMobile; //手机
stri
www.eeworm.com/read/138508/13234140
cpp 单链表的合并.cpp
#include
#include
typedef int datatype;
struct LNode//结构定义
{datatype data;
struct LNode *next;
};
void InitList (LNode * HL)//初始化
{
HL->next=NULL;
}
void
www.eeworm.com/read/315835/13535485
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/315835/13535489
c 双链表正排序.c
#include
#include
#include
struct list{
int data;
struct list *next;
struct list *pre;
};
typedef struct list node;
typedef node *link;
link fr