美文网首页
c语言链表操作

c语言链表操作

作者: 安卓小白之小楼又东风 | 来源:发表于2021-03-13 10:53 被阅读0次

链表的创建

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#define LEN sizeof(struct Student)

//链表
//结构体
struct Student{
    long num;
    float score;
    struct Student *next;
};
//全局变量，记录student的个数
int n;

//创建链表
struct Student* create(){
    struct Student *head;
    struct Student *p1,*p2;
    n = 0;
    p1=p2=(struct Student *)malloc(LEN);
    scanf("%d %f",&p1->num,&p1->score);
    head = NULL;
    //输入0，退出，尾插法
    while(p1->num != 0){
        ++n;
        if(n==1) head = p1;
        else p2->next = p1;
        //p2永远指向链表最后一个元素
        p2 = p1;
        //p1不断生成新的结点
        p1 = (struct Student*)malloc(LEN);
        scanf("%ld %f",&p1->num,&p1->score);
    }
    p2->next = NULL;
    return head;
}
//打印链表元素
void print(struct Student* head){
    struct Student *p;
    printf("The numbers is %d\n",n);
    p = head;
    if(head != NULL){
        do{
            printf("num:%d,score:%5.1f\n",p->num,p->score);
            p = p->next;
        }while(p != NULL);
    }
}
int main(int argc, char* argv[])
{

    struct Student *pt;
    pt = create();
    print(pt);
    system("pause");
    return 0;
}
链表的建立.png

链表原地翻转

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#define LEN sizeof(struct Student)

//链表
struct Student{
    long num;
    float score;
    struct Student *next;
};
int n;

//创建链表
struct Student* create(){
    struct Student *head;
    struct Student *p1,*p2;
    n = 0;
    p1=p2=(struct Student *)malloc(LEN);
    scanf("%d %f",&p1->num,&p1->score);
    head = NULL;
    while(p1->num != 0){
        ++n;
        if(n==1) head = p1;
        else p2->next = p1;
        p2 = p1;
        //p1不断生成新的结点
        p1 = (struct Student*)malloc(LEN);
        scanf("%ld %f",&p1->num,&p1->score);
    }
    p2->next = NULL;
    return head;
}
//逆序
struct Student* reverseOrder(struct Student* head){
    struct Student *p,*temp,*r,*q;
    p = head;
    q = p;
    r = p->next;
    while (r != NULL){
        //temp指针指向r
        temp = r;
        //r指针指向下一个
        r = r->next;
        temp->next = p;
        head = temp;
        p = head;
    }
    q->next = NULL;
    return head;
}
//打印链表元素
void print(struct Student* head){
    struct Student *p;
    printf("The numbers is %d\n",n);
    p = head;
    if(head != NULL){
        do{
            printf("num:%d,score:%5.1f\n",p->num,p->score);
            p = p->next;
        }while(p != NULL);
    }
}
int main(int argc, char* argv[])
{

    struct Student *pt;
    pt = create();
    print(pt);
    pt = reverseOrder(pt);
    print(pt);

    system("pause");
    return 0;
}
Snipaste_2021-03-12_22-45-42.png

链表结点删除

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#define LEN sizeof(struct Student)

//链表
struct Student{
    long num;
    float score;
    struct Student *next;
};
int n;

//创建链表
struct Student* create(){
    struct Student *head;
    struct Student *p1,*p2;
    n = 0;
    p1=p2=(struct Student *)malloc(LEN);
    scanf("%d %f",&p1->num,&p1->score);
    head = NULL;
    while(p1->num != 0){
        ++n;
        if(n==1) head = p1;
        else p2->next = p1;
        p2 = p1;
        //p1不断生成新的结点
        p1 = (struct Student*)malloc(LEN);
        scanf("%ld %f",&p1->num,&p1->score);
    }
    p2->next = NULL;
    return head;
}

//删除链表结点
struct Student* del(struct Student *head,long num){
    struct Student *p1,*p2;
    int count = 0;
    if(head == NULL){
        printf("empty");
        return head;
    }
    p1 = head;
    while(p1 != NULL){
        struct Student *temp;
        if(num == p1->num){
            if(p1 == head){
                temp = p1;
                head = p1->next;
                p1 = p1->next;

            }else{
                temp = p1;
                p2->next = p1->next;

            }
            free(temp);
            printf("delete:%d\n",num);
            n--;
            count++;
        }else{
            p2 = p1;
            p1 = p1->next;
        }

    }
    if(count == 0){
        printf("not found!\n");
    }
    return head;
}

//打印链表元素
void print(struct Student* head){
    struct Student *p;
    printf("The numbers is %d\n",n);
    p = head;
    if(head != NULL){
        do{
            printf("num:%d,score:%5.1f\n",p->num,p->score);
            p = p->next;
        }while(p != NULL);
    }
}
int main(int argc, char* argv[])
{

    struct Student *pt;
    pt = create();
    print(pt);
    pt = del(pt,1001);
    print(pt);
    
    system("pause");
    return 0;
}
结点删除.png

头插法添加结点

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#define LEN sizeof(struct Student)

//链表
struct Student{
    long num;
    float score;
    struct Student *next;
};
int n;

//创建链表
struct Student* create(){
    struct Student *head;
    struct Student *p1,*p2;
    n = 0;
    p1=p2=(struct Student *)malloc(LEN);
    scanf("%d %f",&p1->num,&p1->score);
    head = NULL;
    while(p1->num != 0){
        ++n;
        if(n==1) head = p1;
        else p2->next = p1;
        p2 = p1;
        //p1不断生成新的结点
        p1 = (struct Student*)malloc(LEN);
        scanf("%ld %f",&p1->num,&p1->score);
    }
    p2->next = NULL;
    return head;
}

//头插法
struct Student* ins(struct Student *head,struct Student *stud){
    struct Student *p0,*p1,*p2;
    p0 = head;
    p1 = stud;
    if(head == NULL){
        head = p1;
        p1->next = NULL;
    }else{
        head = p1;
        p1->next = p0;
    }
    n++;
    return head;

}

//打印链表元素
void print(struct Student* head){
    struct Student *p;
    printf("The numbers is %d\n",n);
    p = head;
    if(head != NULL){
        do{
            printf("num:%d,score:%5.1f\n",p->num,p->score);
            p = p->next;
        }while(p != NULL);
    }
}
int main(int argc, char* argv[])
{

    struct Student *pt;
    pt = create();
    print(pt);

    struct Student s1;
    s1.score = 90;
    s1.num = 1004;
    pt = ins(pt,&s1);
    print(pt);
    
    system("pause");
    return 0;
}
头插法.png

修改链表某个结点的值

  • 相当于查找元素，修改其关联元素的值
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#define LEN sizeof(struct Student)

//链表
struct Student{
    long num;
    float score;
    struct Student *next;
};
int n;

//创建链表
struct Student* create(){
    struct Student *head;
    struct Student *p1,*p2;
    n = 0;
    p1=p2=(struct Student *)malloc(LEN);
    scanf("%d %f",&p1->num,&p1->score);
    head = NULL;
    while(p1->num != 0){
        ++n;
        if(n==1) head = p1;
        else p2->next = p1;
        p2 = p1;
        //p1不断生成新的结点
        p1 = (struct Student*)malloc(LEN);
        scanf("%ld %f",&p1->num,&p1->score);
    }
    p2->next = NULL;
    return head;
}

struct Student *change(struct Student *head,long num,float score){
    struct Student *p;
    p = head;
    while (p != NULL){
        if(num == p->num){
            p->score = score;
        }
        p = p->next;
    }
    return head;
}

//打印链表元素
void print(struct Student* head){
    struct Student *p;
    printf("The numbers is %d\n",n);
    p = head;
    if(head != NULL){
        do{
            printf("num:%d,score:%5.1f\n",p->num,p->score);
            p = p->next;
        }while(p != NULL);
    }
}
int main(int argc, char* argv[])
{

    struct Student *pt;
    pt = create();
    print(pt);

    pt = change(pt,1002,99);
    print(pt);

    system("pause");
    return 0;
}
结点删除.png

链表元素排序

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#define LEN sizeof(struct Student)

//链表
struct Student{
    long num;
    float score;
    struct Student *next;
};
int n;

//创建链表
struct Student* create(){
    struct Student *head;
    struct Student *p1,*p2;
    n = 0;
    p1=p2=(struct Student *)malloc(LEN);
    scanf("%d %f",&p1->num,&p1->score);
    head = NULL;
    while(p1->num != 0){
        ++n;
        if(n==1) head = p1;
        else p2->next = p1;
        p2 = p1;
        //p1不断生成新的结点
        p1 = (struct Student*)malloc(LEN);
        scanf("%ld %f",&p1->num,&p1->score);
    }
    p2->next = NULL;
    return head;
}

//排序（按成绩），选择排序
struct Student* sortStudent(struct Student *head){
    struct Student *p,*min,*ptr;
    long tempNum;
    float tempScore;
    p = head;
    while (p->next != NULL){
        min = p;
        ptr = p->next;
        while (ptr != NULL){
            if(min->score > ptr->score){
                min = ptr;
            }
            //交换ptr指针和p的值
            tempNum = min->num;
            min->num = p->num;
            p->num = tempNum;
            
            tempScore = min->score;
            min->score = p->score;
            p->score = tempScore;
            
            ptr = ptr->next;
        }
        p = p->next;
    }
    return head;

}
//打印链表元素
void print(struct Student* head){
    struct Student *p;
    printf("The numbers is %d\n",n);
    p = head;
    if(head != NULL){
        do{
            printf("num:%d,score:%5.1f\n",p->num,p->score);
            p = p->next;
        }while(p != NULL);
    }
}
int main(int argc, char* argv[])
{

    struct Student *pt;
    pt = create();
    print(pt);

    pt = sortStudent(pt);
    print(pt);
    
    system("pause");
    return 0;
}
链表排序.png

两个有序链表的合并

  • 先将两个链表分别排序再合并
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#define LEN sizeof(struct Student)

//链表
struct Student{
    long num;
    float score;

    struct Student *next;
};
int n;

//创建链表
struct Student* create(){
    struct Student *head;
    struct Student *p1,*p2;
    n = 0;
    p1=p2=(struct Student *)malloc(LEN);
    scanf("%d %f",&p1->num,&p1->score);
    head = NULL;
    while(p1->num != 0){
        ++n;
        if(n==1) head = p1;
        else p2->next = p1;
        p2 = p1;
        //p1不断生成新的结点
        p1 = (struct Student*)malloc(LEN);
        scanf("%ld %f",&p1->num,&p1->score);
    }
    p2->next = NULL;
    return head;
}

//合并两个链表
struct Student* merge(struct Student *head1,struct Student *head2){
    struct Student *p1,*p2,*pre,*temp;
    p1 = head1;
    p2 = head2;
    while (p1 != NULL && p2 != NULL){
        if(p1->score <= p2->score){
            pre = p1;
            p1 = p1->next;
        }else{
            if(p1 == head1){
                p2 = p2->next;
                head1 = head2;
                head2->next = p1;
            }else{
                temp = p2;
                p2 = p2->next;
                pre->next = temp;
                temp->next = p1;
                pre = temp;

            }
        }
    }
    if(p1 == NULL){
        pre->next = p2;
    }

    return head1;
}

//排序（按成绩），选择排序
struct Student* sortStudent(struct Student *head){
    struct Student *p,*min,*ptr;
    long tempNum;
    float tempScore;
    p = head;
    while (p->next != NULL){
        min = p;
        ptr = p->next;
        while (ptr != NULL){
            if(min->score > ptr->score){
                min = ptr;
            }
            tempNum = min->num;
            min->num = p->num;
            p->num = tempNum;
            tempScore = min->score;
            min->score = p->score;
            p->score = tempScore;
            ptr = ptr->next;
        }
        p = p->next;
    }
    return head;

}
//打印链表元素
void print(struct Student* head){
    struct Student *p;
    printf("The numbers is %d\n",n);
    p = head;
    if(head != NULL){
        do{
            printf("num:%d,score:%5.1f\n",p->num,p->score);
            p = p->next;
        }while(p != NULL);
    }
}
int main(int argc, char* argv[])
{

    struct Student *pt;
    pt = create();
    pt = sortStudent(pt);
    print(pt);

    struct Student *pt1;
    pt1 = create();
    pt1 = sortStudent(pt1);
    print(pt1);

    pt = merge(pt,pt1);
    print(pt);
    
    system("pause");
    return 0;
}
链表合并.png

按序插入

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#define LEN sizeof(struct Student)

//链表
struct Student{
    long num;
    float score;

    struct Student *next;
};
int n;

//创建链表
struct Student* create(){
    struct Student *head;
    struct Student *p1,*p2;
    n = 0;
    p1=p2=(struct Student *)malloc(LEN);
    scanf("%d %f",&p1->num,&p1->score);
    head = NULL;
    while(p1->num != 0){
        ++n;
        if(n==1) head = p1;
        else p2->next = p1;
        p2 = p1;
        //p1不断生成新的结点
        p1 = (struct Student*)malloc(LEN);
        scanf("%ld %f",&p1->num,&p1->score);
    }
    p2->next = NULL;
    return head;
}



//按序插入,按成绩
struct Student* insSort(struct Student *head,struct Student *stud){
    struct Student *p,*pre,*temp;
    p = head;
    temp = stud;
    if(head->score >= temp->score){
        head = temp;
        temp->next = p;
        return head;
    }
    while (p != NULL){
        if(p->score > temp->score){
            pre->next = temp;
            temp->next = p;
            break;
        }
        pre = p;
        p = p->next;
    }
    return head;
}


//排序（按成绩），选择排序
struct Student* sortStudent(struct Student *head){
    struct Student *p,*min,*ptr;
    long tempNum;
    float tempScore;
    p = head;
    while (p->next != NULL){
        min = p;
        ptr = p->next;
        while (ptr != NULL){
            if(min->score > ptr->score){
                min = ptr;
            }
            tempNum = min->num;
            min->num = p->num;
            p->num = tempNum;
            tempScore = min->score;
            min->score = p->score;
            p->score = tempScore;
            ptr = ptr->next;
        }
        p = p->next;
    }
    return head;

}
//打印链表元素
void print(struct Student* head){
    struct Student *p;
    printf("The numbers is %d\n",n);
    p = head;
    if(head != NULL){
        do{
            printf("num:%d,score:%5.1f\n",p->num,p->score);
            p = p->next;
        }while(p != NULL);
    }
}
int main(int argc, char* argv[])
{

    struct Student *pt;
    pt = create();
    pt = sortStudent(pt);
    print(pt);

    struct Student *s2;
    //必须申请空间
    s2=(struct Student *)malloc(LEN);
    s2->score = 78;
    s2->num = 1005;
    pt = insSort(pt,s2);
    print(pt);
    system("pause");
    return 0;
}
有序添加.png

释放内存

#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#define LEN sizeof(struct Student)

//链表
struct Student{
    long num;
    float score;

    struct Student *next;
};
int n;

//创建链表
struct Student* create(){
    struct Student *head;
    struct Student *p1,*p2;
    n = 0;
    p1=p2=(struct Student *)malloc(LEN);
    scanf("%d %f",&p1->num,&p1->score);
    head = NULL;
    while(p1->num != 0){
        ++n;
        if(n==1) head = p1;
        else p2->next = p1;
        p2 = p1;
        //p1不断生成新的结点
        p1 = (struct Student*)malloc(LEN);
        scanf("%ld %f",&p1->num,&p1->score);
    }
    p2->next = NULL;
    return head;
}

//打印链表元素
void print(struct Student* head){
    struct Student *p;
    printf("The numbers is %d\n",n);
    p = head;
    if(head != NULL){
        do{
            printf("num:%d,score:%5.1f\n",p->num,p->score);
            p = p->next;
        }while(p != NULL);
    }
}
void deleteAll(struct Student *head){
    struct Student *p,*temp;
    p = head;
    while (p != NULL){
        n--;
        temp = p;
        p = p->next;
        free(temp);
    }
    printf("%d numbers\n",n);
}
int main(int argc, char* argv[])
{

    struct Student *pt;
    pt = create();
    print(pt);

    deleteAll(pt);
    system("pause");
    return 0;
}
delete.png

相关文章

  • c语言链表操作

    链表的创建 链表原地翻转 链表结点删除 头插法添加结点 修改链表某个结点的值 相当于查找元素，修改其关联元素的值 ...

  • 链式存储结构的线性表

    单链表结构可用如下C语言代码描述 建立链表操作 读取操作 插入节点操作 删除一个节点操作 遍历操作 链式存储结构线...

  • “学习，是一种升级”文集目录

    一、C语言 C语言学习：链表的概念和其简单操作 C语言学习：关于数据的几种排序算法 C语言项目：学生信息管理系统 ...

  • C++实现双向循环链表

    本次博文是关于利用C++模板的方式实现的双向循环链表以及双向循环链表的基本操作，在之前的博文C++语言实现双向链表...

  • 单链表的冒泡，快排，选择，插入，归并等多图详解

    上节介绍了链表的基本操作史上最全单链表的增删改查反转等操作汇总以及5种排序算法(C语言)这节介绍链表的5种排序算法...

  • C++语言实现双向链表

    这篇文章是关于利用C++模板的方式实现的双向链表以及双向链表的基本操作，在之前的博文C语言实现双向链表中，已经给大...

  • 动态链表的基本操作

    1.动态单链表的创建（creat） 链表各类操作详解百度传课之C语言启蒙 (1)开辟动态内存的C标准库函数：mal...

  • C语言基础 之 链表操作

    链表的操作 对链表的主要操作有建立链表、结构的查找与输出、结点数据的删除和结点数据的插入示例 动态链表的建立 动态...

  • 玩转C语言链表-链表各类操作详解

    链表概述 链表是一种常见的重要的数据结构。它是动态地进行存储分配的一种结构。它可以根据需要开辟内存单元。链表有一个...

  • 链表逆置C语言完整代码

    链表逆置C语言完整代码

网友评论

      本文标题：c语言链表操作

      本文链接：https://www.haomeiwen.com/subject/cfrtcltx.html

      延伸阅读

      深度阅读

      • 您也可以注册成为美文阅读网的作者，发表您的原创作品、分享您的心情！

      栏目导航

      热点阅读

      关于我们|服务条款|联系我们|c语言链表操作|投稿指南|网站地图|RSS订阅|排版工具|手机版

      提供经典美文摘抄,优美散文欣赏,现代诗歌精选,短篇小说,心情随笔,表白情书范文,故事会在线阅读欣赏

      Copyright © 2014-2023 Haomeiwen.com All Rights Reserved. 好美文阅读网 版权所有

      备案信息：桂公网安备 45052102000051号 · 桂ICP备13007215号-3

      本站所收录作品、热点评论等信息部分来源互联网，目的只是为了系统归纳学习和传递资讯

      所有作品版权归原创作者所有，与本站立场无关，如不慎侵犯了你的权益，请联系我们告知，我们将做删除处理！