【数据结构】单链表的相关笔记

#include "stdio.h"
#include "malloc.h"
#define OK 1
#define ERROR 0

typedef int Status;
typedef int ElemType;

typedef struct LNode
{
    ElemType data;
    struct LNode* next;
}LNode, * LinkList;  //结点类型LNode，链表类型的定义LinkList

void CreateList(LinkList& L, int n);//初始化单链表
int LocateElem(LinkList L, ElemType e);//返回表中第一个与e相等的元素位序。若不存在，返回0
Status GetElem(LinkList L, int i, ElemType& e);//获取ai元素的值返回在e中。如果i不合法，返回ERROR，否则为e赋值，返回OK
void ListPrint(LinkList L);//打印链表
Status ListDelete(LinkList& L, int i, ElemType& e);//实现在 链表L上删除ai元素，并将该元素在e中返回。需要判断输入i的合法性。
Status ListInsert(LinkList& L, int i, ElemType e);//实现在链表中ai元素之前插入元素e,需要判断输入i的合法性。
Status Intersection(LinkList La, LinkList Lb, LinkList& Lc); //实现La和Lb的交集Lc
Status Difference(LinkList La, LinkList Lb, LinkList& Lc); //实现La和Lb的差集Lc
Status PTR_AI(LinkList& Lc, ElemType i, ElemType s);
Status ListOrderInsert(LinkList& L, ElemType e);
void  Reverse(LinkList La, LinkList& Lb);
int main()
{
    LinkList La, Lb;
    int n;

    scanf("%d", &n);
    CreateList(La, n);//构造有n个元素的表
    Reverse(La, Lb);
    ListPrint(Lb);
    return 0;
}
/* 请在这里填写答案 */
void ListPrint(LinkList L)//打印整张表 
{
    LinkList p;
    p = L->next;
    if (p == NULL)    //空表，输出NULL
    {
        printf("NULL");
        return;
    }
    while (p != NULL) //表非空，依次输入各个元素的值，用空格隔开。注意最后一个元素后面没有空格
    {
        if (p == L->next)
        {
            printf("%d", p->data);
        }
        else printf(" %d", p->data);
        p = p->next;
    }
}
void CreateList(LinkList& L, int n) {
    LinkList q, p;
    L = (LinkList)malloc(sizeof(LNode));
    L->next = NULL;
    q = L;
    for (int i = 1; i <= n; i++)
    {
        p = (LinkList)malloc(sizeof(LNode));
        scanf("%d", &p->data);
        q->next = p;
        q = q->next;
    }
}  //初始化单链表
Status GetElem(LinkList L, int i, ElemType& e) {
    LinkList p;
    p = L->next; int j = 1;
    while (p && j < i)
    {
        p = p->next;
        j++;
    };
    if (!p)
    {
        return ERROR;
    }
    e = p->data;
    return OK;


}
int LocateElem(LinkList L, ElemType e) {
    LinkList p;
    p = L->next;
    int j = 1;
    while (p)
    {
        if (p->data == e)
        {
            return j;
        }
        p = p->next;
        j++;
    };
    return ERROR;

}
Status ListDelete(LinkList& L, int i, ElemType& e)//实现在 链表L上删除ai元素，并将该元素在e中返回。需要判断输入i的合法性。
{
    LinkList p, s;
    p = L; int j = 0;
    while (p && j < i - 1)
    {
        p = p->next;
        j++;
    };
    if (!p) return ERROR;

    s = p->next;
    e = s->data;

    p->next = s->next;
    free(s);
    return OK;
}
Status ListInsert(LinkList& L, int i, ElemType e)//实现在链表中ai元素之前插入元素e,需要判断输入i的合法性。
{
    LinkList s, p;
    int j;
    p = L; j = 0;
    while (p && j < i - 1)
    {
        p = p->next;
        ++j;
    }
    if (!p) return ERROR;

    s = (LinkList)malloc(sizeof(LNode));
    if (!s) return ERROR;
    s->data = e;

    s->next = p->next;
    p->next = s;

    return OK;
}
Status Intersection(LinkList La, LinkList Lb, LinkList& Lc)
{
    LNode* q1, * q2, * q3, * p;
    q3 = Lc;
    q1 = La->next;
    while (q1 != NULL)
    {
        q2 = Lb->next;
        while (q2 && q1->data != q2->data)
        {
            q2 = q2->next;
        }
        if (q2 != NULL)
        {
            p = (LNode*)malloc(sizeof(LNode));
            p->data = q1->data;
            q3->next = p;
            q3 = q3->next;
        }
        q1 = q1->next;
    }
    q3->next = NULL;
    return OK;
}
Status Difference(LinkList La, LinkList Lb, LinkList& Lc)
{
    LinkList p1, p2, p3, q;
    p3 = (LinkList)malloc(sizeof(LNode));
    p1 = La->next;
    p3 = Lc;
    while (p1)
    {
        p2 = Lb->next;
        while (p2 && p1->data != p2->data)
        {
            p2 = p2->next;
        }
        if (p2 == NULL)
        {
            q = (LinkList)malloc(sizeof(LNode));
            q->data = p1->data;
            p3->next = q;
            p3 = p3->next;
        }
        p1 = p1->next;
    }
    p3->next = NULL;
    return OK;
}
Status PTR_AI(LinkList& La, ElemType i, ElemType s)//i=位序    s=输入的数值
{
    LinkList p,e;
    int temp;
    p = La->next; int j = 1;
    while (j<i)
    {
        p = p->next;
        j++;
    }//遍历到ai而不是ai-1
    e = (LinkList)malloc(sizeof(LNode));
    e->data = s;

    e->next = p->next;
    p->next = e;//在ai后面开辟新节点
    
    temp= p->data;
    p->data = e->data;
    e->data = temp;//两数交换

    return 0;
}//211806141
Status ListOrderInsert(LinkList& L, ElemType e) {
    LinkList p,q;
    int temp;
    p = L;
    if (!p) return ERROR;

    q = (LinkList)malloc(sizeof(LNode));
    q->data = e;

    while (p->next != NULL )
    {
        if (p->data <= e && p->next->data >= e )
        {
            q->next = p->next;
            p->next = q;
            return OK;
        }
        p = p->next;
    }
    q->next = p->next;
    p->next = q;
    return OK;
}
void  Reverse(LinkList La, LinkList& Lb) {
    LinkList q, p;
    q = La;

    Lb = (LinkList)malloc(sizeof(LNode));
    Lb->next = NULL;


    while (q)
    {
        p = (LinkList)malloc(sizeof(LNode));

        p->data = q->data;
        
        p->next = Lb->next;
        Lb->next = p;

        q = q->next;
    }
    



}