链表通讯录文件读取保存

最新推荐文章于 2021-08-14 16:36:16 发布
原创最新推荐文章于 2021-08-14 16:36:16 发布 · 1k 阅读
9 ·
CC 4.0 BY-SA版权
本文介绍了一个简单的链表操作实现，包括链表的初始化、插入、显示、查找、删除及修改等基本功能，并提供了完整的C语言代码示例。
实现信息的存储
#ifndef _LINKLIST_H
#define _LINKLIST_H
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#define SIZE 1000

#define FAILURE    10000
#define SUCCESS    10001
#define TRUE       10002
#define FALSE      10003

struct node
{
    char name[100];
    int age;
    struct node *next;
};
typedef struct node Node;

#endif

int LinkInit(Node **l)      //初始化
{
    *l=(Node *)malloc(sizeof(Node)*1);
    if(NULL == *l)
    {
        return FAILURE;
    }
    (*l)->next=NULL;
    return SUCCESS;
}

int LinkInsert(Node *l)
{
    Node *p=l;
    char flag = 'y';
    if(NULL == l)
    {
        return FAILURE;
    }
    while(flag == 'y')
    {
        Node *q=(Node *)malloc(sizeof(Node)*1);  //要插入的
        printf("Please input name and age:");
        scanf("%s%d",q->name,&q->age);

        q->next=NULL;
        p->next=q;
        p=q;
        getchar();
        printf("finish?(y/n)");
        scanf("%c",&flag);
    }
    return SUCCESS;
}

int LinkShow(Node *l)
{
    if(NULL == l)
    {
        return FAILURE;
    }
    Node *q = l;
    while(q->next)
    {
        q=q->next;
        printf("name:%s age:%d\n",q->name,q->age);
    }
    getchar();
    getchar();
    return SUCCESS;
}
int sum(Node *l)
{
    int count = 0;
    Node *p;
    p=l->next;
    if(NULL != p)
    {
        p=p->next;
        count++;
    }
    return count;
}


int LinkFind(Node *l)
{
    if(NULL == l )
    {
        return FAILURE;
    }
    char *p;
    p =(char *)malloc(sizeof(char)*32);
    printf("Please input the name you want to find: \n");
    scanf("%s",p);
    Node *q = l;
    while(q != NULL)
    {
        if(strcmp(q->name,p) == 0)
        {
            printf("name:%s age:%d \n",q->name,q->age);
            break;
        }
        else
        {
            q=q->next;
        }
    }
    if(!q)
    {
        return FAILURE;
    }
    getchar();
    getchar();
    return SUCCESS;
}


int LinkDelete(Node *l)
{
    if(NULL == l)
    {
        return FAILURE;
    }
    Node *q = l;
    Node *m = l;
    Node *t;
    int n=0;
    int k=1;
    char *p;
    p = (char*)malloc(sizeof(char)*32);
    printf("Please input the name you want to delete:");
    scanf("%s",p);
    while(l->next != NULL)
    {
        q = q->next;
        n++;
        if(strcmp(q->name,p) == 0)
        {
            t = q;
            break;
        }
    }
    while (k < n && m != NULL)
    {
        m = m->next;
        k++;
    }
    m->next=t->next;
    free(p);
    return SUCCESS;
}


int LinkCorrect(Node *l)
{
    if(NULL == l )
    {
        return FAILURE;
    }

    char *p;
    p =(char *)malloc(sizeof(char)*32);
    printf("Please input the name you want to change:");
    scanf("%s",p);
    Node *q = l;
    while(q != NULL)
    {
        if(strcmp(q->name,p) == 0)
        {
            printf("Please input the name after change:");
            scanf("%s",q->name);
            printf("Please input the age after change:");
            scanf("%d",&q->age);
            break;
        }
        else
        {
            q=q->next;
        }
    }
    if(!q)
    {
        return FAILURE;
    }
    return SUCCESS;
}





void welcome()
{
    printf("\t\t\033[46m*************************\n");
    printf("\t\t*********Welcome!********\n");
    printf("\t\t*************************\n");
}
void menu()
{
    system("clear");
    printf("\n");
    printf("\t\t************************\n");
    printf("\t\t1.添加            2.查看 \n");
    printf("\t\t3.查找            4.删除 \n");
    printf("\t\t5.修改            6.返回 \n");
    printf("\t\t************************\n");
}


void download(Node *s)      //从文件读取
{
    if(NULL == s)
    {
        return ;
    }
    int fd = open("Student.txt",O_RDONLY | O_CREAT);
    if(-1 == fd)
    {
        perror("open");
        exit(1);
    }
    Node *p = s;
    int ret;
    while(1)
    {
        while(p->next == NULL)       //尾插法
        {
            p = p->next;
        }
        Node *q=(Node *)malloc(sizeof(Node)*1);
        ret = read(fd, (void *)q, sizeof(Node)-4);    //去除指针的四个字节
        if(ret ==  0)
        {
            break;
        }
        q->next=NULL;
        p->next=q;
        if(-1 == ret)
        {
            perror("read");
            exit(1);
        }
    }
    close(fd);

}


void save(Node *s)
{
    if(NULL == s)
    {
        return;
    }
    int fd = open("Student.txt",O_WRONLY | O_CREAT);
    if(-1 == fd)
    {
        perror("open");
        exit(1);
    }
    int ret = ftruncate(fd, 0);       //清空文件
    if(ret == -1)
    {
        perror("ftruncate");
        exit(1);
    }
    int ret1 = lseek(fd,0,SEEK_SET);
    if(-1 == ret1)
    {
        perror("lseek");
        exit(1);
    }
    int ret2;
    Node *q=s;

    while(q->next != NULL)
    {
        q=q->next;

        ret2 = write(fd,(void *)q,sizeof(Node)-4);
        if(-1 == ret2)
        {
            perror("write");
            exit(1);
        }
    }
    close(fd);

}

int main()
{
    Node *first = NULL;
    download(first);
    int choice;
    welcome();
    LinkInit(&first);
    while(1)
    {
        menu();
        scanf("%d",&choice);
        switch(choice)
        {
            case 1:LinkInsert(first);
                   break;
            case 2:LinkShow(first);
                   break;
            case 3:LinkFind(first);
                   break;
            case 4:LinkDelete(first);
                   break;
            case 5:LinkCorrect(first);
                   break;
            case 6:save(first);
                   exit(0);
                   break;

        }
    }
    return 0;
}