代码搜索：链表实现
找到约 10,000 项符合「链表实现」的源代码
代码结果 10,000
www.eeworm.com/read/410670/11272500
dsp 单链表删除.dsp
# Microsoft Developer Studio Project File - Name="单链表删除" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Con
www.eeworm.com/read/410670/11272503
cpp 单链表删除.cpp
#include
#include
//单链表的定义：
typedef char DataType; //DataType可以是任何相应的数据类型如int, float或char
typedef struct node //结点类型定义
{ DataType data; //结点的数据域
struct node *next; //
www.eeworm.com/read/264077/11330549
cpp 自然归并(链表).cpp
#include
#include
#define N 20
typedef struct chain // 结点结构
{
int info;
struct chain* next;
} node;
typedef node* nodepointer;
void init_array( nodepointer
www.eeworm.com/read/405283/11467055
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/342486/12016697
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/339359/12241573
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/250489/12404146
rar 双向链表实验.rar
www.eeworm.com/read/129157/14262754
txt 单向链表类.txt
public class SinglyLinkedList //单向链表类
{
protected int count; //变量count用来标识链表长度
protected SinglyLinkedListElement head; //变量head表示链表头
public SinglyLinkedList() //SinglyLinkedList 的构
www.eeworm.com/read/227639/14418900
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/122926/14656610