数据结构学习第二天

21:31:04 2019-08-17

今天开始的时间有点晚

 00:09:22 2019-08-18

又重新开始学 希望这次能够入门  每天开始学习数据结构的时间有点晚了 要调整一下

23:26:58 2019-08-20

 补上了测试

单链表

List.h

#ifndef _LIST_H
#define _LIST_H
#define len sizeof(Node)

typedef struct Node* PtrToNode;
typedef PtrToNode List;
typedef PtrToNode Position;
struct Node
{
    int Element;
    Position Next;
};
List MakeEmety(List L);
int IsEmpty(List L);
int IsLast(Position P, List L);
Position Find(int Element, List L);
void Delete(int Element, List L);
Position FindPrevious(int Element, List L);
void Insert(int Element, List L, Position P);
void DeleteList(List L);
Position Header(List L);
Position First(List L);

#endif // !_LIST_H

List.c

#include<malloc.h>
#include "List.h"
extern struct Node;

List MakeEmety(List L)
{
    L = (List)malloc(len);
    L->Element = 0;
    L->Next = NULL;
    return L;
}

int IsEmpty(List L)
{
    return L->Next == NULL;
}


int IsLast(Position P, List L)
{
    return P->Next == NULL;
}

Position Find(int Element, List L)
{
    Position P = L->Next;
    /*while (P!=NULL)
    {
        if (P->Element == Element)
            return P;
        else
            P = P->Next;
    }
    return NULL;*/
    while (P!=NULL&&P->Element!=Element)
    {
        P = P->Next;
    }
    return P;
}

void Delete(int Element, List L)
{
    Position P1, P2;
    P1=P2= FindPrevious(Element,L);
    P2 = P1->Next;
    //P1->Next = P1->Next->Next;
    P1->Next = P2->Next;
    free(P2);
}

Position FindPrevious(int Element, List L)
{
    Position P = L;
    /*while (P ->Next!= NULL)
    {
        if (P->Next->Element == Element)
            return P;
        else
            P = P->Next;
    }
    return NULL;*/
    while (P->Next!=NULL&&P->Next->Element!=Element)
    {
        P = P->Next;
    }
    return P;
}

void Insert(int Element, List L, Position P)
{
    Position P1 = (Position)malloc(len);
    P1->Element = Element;
    Position PreP = FindPrevious(P->Element,L);
    P1->Next = P;
    PreP->Next = P1;
}

void DeleteList(List L)
{
    Position P1, P2;
    P1 = P2 = L;
    while (P2!= NULL)
    {
        P2 = P1->Next;
        free(P1);
        P1 = P2;
    }
}

Position Header(List L)
{
    return L;
}

Position First(List L)
{
    return L;
}

main.c

#include<stdio.h>
#include<malloc.h>
#include"List.h"
using namespace std;
int main()
{
    List L=NULL;
    L=MakeEmety(L);
    printf("%10d %10d
", IsEmpty(L),IsLast(L,L));
    Position P = (Position)malloc(len);
    L->Next = P;
    P->Element = 20;
    P->Next = NULL;
    printf("%10d %10d
", P->Element, IsLast(P, L));
    Insert(25, L, P);
    printf("%10d %10d
", L->Next->Element, IsLast(L->Next, L));
    printf("%10d
", Find(20, L)->Element);
    Delete(20, L);
    Delete(25, L);
    printf("%10d
", IsEmpty(L));
    DeleteList(L);
    return 0;
}

运行结果