程序代码：

#include <stdio.h>
#include <malloc.h>

//单链表定义
typedef struct LNode {
    int data;
    struct LNode *next;
}LNode, *LinkList;

//单链表初始化
int InitLinkList(LinkList &L) {
    L = (LinkList)malloc(sizeof(LNode));
    if(!L) return -1;
    L -> next = NULL;
    return 1;
}

//单链表求长
int listLength(LinkList L) {
    LNode *p = L;
    int j = 0;
    while(p -> next) {
        p = p -> next;
        j++;
    }
    return j;
}

//单链表取元素
int getElem(LinkList L, int i, int *e) {
    LNode *p = L;
    int j = 0;
    while(j < i && p -> next) {
        p = p -> next;
        j++;
    }
    if(j == i) {
        e = p -> data;
        return 1;
    }
    else return -1;
}

//单链表查找
LinkList locateElem(LinkList L, int e) {
    LNode *p = L -> next;
    while(p && (p -> data != e)) p = p -> next;
    if(p) return p;
    else return NULL;
}

//单链表插入
int listInsert(LinkList *L, int i, int e) {
    LNode *p = L, *q;
    int j = 0;
    while(j < i - 1 && p -> next) {
        p = p -> next;
        j++;
    }
    if(j == i - 1) {
        q = (LNode *)malloc(sizeof(LNode));
        if(!q) return -1;
        q -> data = e;
        q -> next = p -> next;
        p -> next = q;
        return 1;
    }
    else return -1;
}

//单链表删除
int listDelete(LinkList *L, int i, int *e) {
    LNode *p = L, *q;
    int j = 0;
    while(j < i - 1 && p -> next) {
        p = p -> next;
        j++;
    }
    if(j == i - 1 && p -> next) {
        q = p -> next;
        p -> next = q -> next;
        e = q -> data;
        free(q);
    }
    else return -1;
}

int main() {
    LinkList L;
    return 0;
}

程序代码：

#include <stdio.h>
#include <malloc.h>
#define TRUE 1;
#define FALSE 0;
#define OK 1;
#define ERROR 0;
#define OVERFLOW -2;
#define ListSpaceIncr 20
typedef int Status;
typedef int LElemType;
//单链表定义
typedef struct LNode {
    int data;
    struct LNode *next;
}LNode, *LinkList;
//单链表初始化
Status InitLinkList(LinkList L) {
    L = (LNode *)malloc(sizeof(LNode));
    if(!L) return OVERFLOW;
    L -> next = NULL;
    return OK;
}
//单链表求长
int listLength(LinkList L) {
    LNode *p = L;
    int j = 0;
    while(p -> next) {
        p = p -> next;
        j++;
    }
    return j;
}
//单链表取元素
Status getElem(LinkList L, int i, LElemType *e) {
    LNode *p = L;
    int j = 0;
    while(j < i && p -> next) {
        p = p -> next;
        j++;
    }
    if(j == i) {
        *e = p -> data;
        return OK;
    }
    else return ERROR;
}
//单链表查找
LinkList locateElem(LinkList L, LElemType e) {
    LNode *p = L -> next;
    while(p && (p -> data != e)) p = p -> next;
    if(p) return p;
    else return NULL;
}
//单链表插入
Status listInsert(LinkList L, int i, LElemType e) {
    LNode *p = L, *q;
    int j = 0;
    while(j < i - 1 && p -> next) {
        p = p -> next;
        j++;
    }
    if(j == i - 1) {
        q = (LNode *)malloc(sizeof(LNode));
        if(!q) return -1;
        q -> data = e;
        q -> next = p -> next;
        p -> next = q;
        return OK;
    }
    else return ERROR;
}
//单链表删除
Status listDelete(LinkList L, int i, LElemType *e) {
    LNode *p = L, *q;
    int j = 0;
    while(j < i - 1 && p -> next) {
        p = p -> next;
        j++;
    }
    if(j == i - 1 && p -> next) {
        q = p -> next;
        p -> next = q -> next;
        *e = q -> data;
        free(q);
    }
    else return ERROR;
}
int main() {
    return 0;
}