·C语言·
来源:百度知道 编辑:UC知道 时间:2024/05/12 03:49:26
偶需要:将节点介入到链表末尾的代码
Status ListInsert_L(LinkList &L, int i, ElemType e)
{
p = L; j = 0;
while(p) {p = p->next; }
if(!p) return ERROR;
s = (LinkList) malloc(sizeof(LNode));
s->data = e;
s->next = p->next;
p->next = null;
return OK;
}
双链哩?
#include
#define MAX 10
int testData[2][MAX] = { 1,2,3,4,5,6,7,8,9,10,
100,200,300,400,500,600,700,800,900,1000 };
struct List {
int number;
int data;
struct List *Next;
};
typedef struct List Node;
typedef Node *Link;
int searchTimes = 0;
Link createList(Link Head) {
int newNumber;
int newData;
Link Pointer;
Link New;
int i;
printf("分配节点内存\t");
Head = (Link)malloc(sizeof(Node));
if(Head == NULL) {
printf("assign memory error");
}
else {
printf("数据项存入节