c语言 linked list

最新推荐文章于 2024-07-11 12:23:05 发布

Marionette

最新推荐文章于 2024-07-11 12:23:05 发布

阅读量4.2k

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构文章标签：语言 struct c null allocation list

本文链接：https://blog.youkuaiyun.com/yuxinleipp/article/details/7538122

数据结构专栏收录该内容

3 篇文章

订阅专栏

本文介绍了一种使用C语言实现的简单链表结构，并详细解释了链表的创建、遍历和删除节点的基本操作。通过实例演示，帮助读者理解链表的基本概念和在实际编程中的应用。

MyLinkList.h

#include <stdlib.h>
#include <string.h>
#define  NEW  (struct node *)malloc(sizeof(struct node))

struct node
{
    char name[20];
    char tel[9];
    struct  node *next;
};

/* 创建 linked list   */

struct node *create()
{
    static struct node *h;
    struct node *p,*q;
    char name[20];
    h = NULL;
    printf("name : ");
    gets(name);
    while(0 != strlen(name))
    {
        p = NEW;
        if(NULL == p)
        {
            printf("allocation failure \n");
            exit(0);
        }
        strcpy(p->name,name);
        printf("tel : ");
        gets(p->tel);
        p->next = NULL;
        if(NULL == h)
            h = p;
        else
            q->next = p;
        q = p;
        printf("name: ");
        gets(name);
    }
    return h;
}

/* 遍历linked list   */

void printlist(struct node *head)
{
    struct node *p;
    p = head;
    while(NULL != p)
    {
        printf("%s\t%s\n",p->name,p->tel);
        p = p->next;

    }

}

/* 删除节点   */

struct node *delnode(struct node *head, char *x)
{
    struct node *p,*q;
    static struct node *h;
    if(NULL == head)
    {
        printf("this is a empty linked list");
        return head;
    }
    p = head;
    while(0 != strcmp(x,p->name) && NULL != p->next)
    {
        q = p;
        p = p->next;
    }
    if(0 == strcmp(x,p->name))
    {
        if( p == head)
            head = p->next;
        else
            q->next = p->next;
        free(p);
    }
    else
        printf("can't find your node");
    h = head;
    return h;
}

main.c

#include <stdio.h>
#include "MyLinkList.h"



int main(void)
{
    struct node *head;
    head = create();

    printf("-----------遍历测试-----------------\n");

    printlist(head);

     printf("---------删除测试-------------\n");

     char *delchar[20];
     gets(delchar);
     delnode(head,delchar);
     printlist(head);
     printf("-------------------------------\n");




     printf("-------------------------------\n");





     printf("-------------------------------\n");



}