1. 头结点表示链表中第一个结点的存储位置
2. 最后一个结点的存储位置为空(NULL);
#ifndef __LINKLLIST_H__
#define __LINKLLIST_H__
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLF -1
#define OVERFLOW -2
#define LIST_INIT_SIZE 100
#define LISTINCREMENT 10
typedef int Status;
typedef int ElemType;
typedef struct LNode{
ElemType data;
struct LNode *next;
}LNode, *LinkList;
#endif
#include"LinkList.h"
#include
#include
void CreateList_L(LinkList &L, int n) {
L = (LinkList)malloc(sizeof(LNode));
L -> next = NULL;
for(ElemType i = n; i > 0; i --) {
LinkList p = (LinkList)malloc(sizeof(LNode));
p -> data = i;
p -> next = L -> next;
L -