数据结构--单链表 C语言

//单链表基本操作


1.1创建空链表：

  1.2创建N个节点的链表

  2.删除节点

 3.添加新节点

#include <stdio.h>

#include <stdlib.h>
 
  5 
typedef struct _NODE
{
    int data;
    struct _NODE *pNext;
}NODE,*PNODE;

PNODE Create_List(void)
{
    int len = 0;
    int data,i = 0;
    PNODE pHead = NULL;
    pHead = (PNODE)malloc(sizeof(NODE));
    PNODE pTail = pHead;
    pTail->pNext = NULL;

    if(pHead == NULL)
    {
        printf("内存分配失败!
");
    }
    else
    {
        printf("请输入链表长度：
");
        scanf_s("%d",&len);
        for(;i < len ; i++)
        {
            PNODE q = (PNODE)malloc(sizeof(NODE));
            if(q == NULL)
            {
                printf("内存分配失败!
");
            }
            else
            {
                printf("请输入数据:
");
                scanf_s("%d",&data);
                q->data = data;
                pTail->pNext = q;
                q->pNext = NULL;
                pTail = q;
            }    
        }
    }

    return pHead;
}

void Traverse_List(PNODE pHead)
{
    PNODE p = pHead->pNext;
    if(p == NULL)
    {
        printf("链表为空！
");
    }
    else
    {
        while(p != NULL)
        {
            printf("%d
",p->data);
            p = p->pNext;    
        }
    }

}


bool List_Insert(PNODE pHead,int pos, int val)
{
    int i = 0;
    PNODE p = pHead;
    if(p == NULL)
    {
        return false;
    }
    else
    {
        while(p != NULL && i < pos-1)
        {
            i++;
            p = p->pNext;
        }

        if(i > pos -1) return false;

        PNODE q = (PNODE)malloc(sizeof(NODE));
        if(q == NULL)
        {
            printf("内存分配失败!
");
            return false;
        }
        q->data = val;

        PNODE temp = p;
        q->pNext = p->pNext;
        p->pNext = q;

        return true;
        
    }

}

bool List_Delete(PNODE pHead,int pos)
{
    int i = 0;
    PNODE p = pHead;
    if(p == NULL)
    {
        return false;
    }
    else
    {
        while(p != NULL && i < pos-1)
        {
            i++;
            p = p->pNext;
        }

        if(i > pos -1) return false;

        PNODE temp = p->pNext;
        p->pNext = temp->pNext;
        free(temp);
        temp =NULL;

        return true;
        
    }
}

bool List_Isempty(PNODE pHead)
{
    if(pHead->pNext == NULL)
        return true;
    else
        return false;
}

int List_len(PNODE pHead)
{
    int len = 0;
    PNODE p = pHead->pNext;
    while(p != NULL)
    {
        len++;
        p = p->pNext;
    }
    return len;
}

void List_sort(PNODE pHead)
{
    int len = List_len(pHead);
    int i,j;
    PNODE p = pHead->pNext;
    for(i = 0;i < len - 1; i++)
    {
        for(j = i+1,p = pHead->pNext;j < len;j++,p=p->pNext )
        {
            /*
            if(a[j] < a[i])
            {
                int temp = a[i];
                a[i] = a[j];
                a[j] = temp;
            }
            */
            if(p->pNext->data < p->data)
            {
                int temp = p->data;
                p->data = p->pNext->data;
                p->pNext->data = temp;
            }
        }
    }


}


int main(void)
{
    PNODE pHead = Create_List();
    printf("链表长度:%d
",List_len(pHead));
    if(List_Isempty(pHead))
        printf("链表为空
");
    else
    {
        printf("链表不为空
");
        Traverse_List(pHead);
        List_sort(pHead);
        printf("链表排序;
");
        Traverse_List(pHead);
        printf("链表插入;
");
        List_Insert(pHead,3,100);
        Traverse_List(pHead);
        printf("链表删除;
");
        List_Delete(pHead,4);
        Traverse_List(pHead);
    }
    system("pause");
    return 0;
}

程序运行结果：