无头单链表的创建，及无头单链表逆转

最新推荐文章于 2024-08-03 19:09:26 发布

原创最新推荐文章于 2024-08-03 19:09:26 发布 · 420 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#单链表 #指针 #c语言

基础篇专栏收录该内容

26 篇文章

订阅专栏

本文提供了无头单链表的头插法、尾插法及其逆转的具体实现代码，并通过示例展示了如何创建并显示单链表，适用于初学者理解单链表的基本操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

无头头插单链表：

#include <stdio.h>
#include <stdlib.h>

typedef struct person
{
    int age;
    struct person *next;
}per;

per *head_list(per *one,int num)
{
    per *temp = (per *)malloc(sizeof(per));
    temp->age = num;
    temp->next = one;

    return temp;
}

void show(per *head)
{
    if(NULL == head)
    {
        return;
    }
    while(head)
    {
        printf("age is %d\n",head->age);
        head = head->next;
    }
}

int main()
{
    per *head = NULL;

    head = head_list(head,10);
    head = head_list(head,20);
    head = head_list(head,30);
    head = head_list(head,40);
    head = head_list(head,50);
    show(head);
    return 0;
}

无头尾插单链表：

#include <stdio.h>
#include <stdlib.h>

typedef struct person
{
    int age;
    struct person *next;
}per;

per *tail_list(per *one, int num)
{
    per *temp = (per *)malloc(sizeof(per));
    
    temp->age = num;
    per *head = one;

    if(NULL == one)
    {
        return temp;
    }
    while(one->next)
    {
        one = one->next;
    }
    one->next = temp;

    return head;
}

void show(per *head)
{
    if(NULL == head)
    {
        return;
    }
    while(head)
    {
        printf("age is %d\n",head->age);
        head = head->next;
    }
}

int main()
{
    per *head = NULL;

    head = tail_list(head,10);
    head = tail_list(head,20);
    head = tail_list(head,30);
    head = tail_list(head,40);
    head = tail_list(head,50);
    show(head);
    return 0;
}

无头头插单链表逆转

#include <stdio.h>
#include <stdlib.h>

typedef struct person
{
    int age;
    struct person *next;
}per;

per *head_list(per *one, int num)
{
    per *temp = (per *)malloc(sizeof(per));
    
    temp->age = num;
    temp->next = one;

    return temp;
}

per *reverse(per *head)
{
    if(NULL == head)
    {
        return;
    }
    per *p,*q,*r;

    p = head;
    q = p->next;
    r = q->next;
    head->next = NULL;
    while(r)
    {
        q->next = p;
        p = q;
        q = r;
        r = r->next;
    }
    q->next = p;
    head = q;

    return head;
}

void show(per *head)
{
    if(NULL == head)
    {
        return;
    }
    while(head)
    {
        printf("age is %d\n",head->age);
        head = head->next;
    }
}

int main()
{
    per *head = NULL;

    head = head_list(head,10);
    head = head_list(head,20);
    head = head_list(head,30);
    head = head_list(head,40);
    head = head_list(head,50);
    show(head);
    printf("==================\n");
    head = reverse(head);
    show(head);
    return 0;
}

无头尾插单链表逆转：

#include <stdio.h>
#include <stdlib.h>

typedef struct person
{
    int age;
    struct person *next;
}per;

per *tail_list(per *one, int num)
{
    per *temp = (per *)malloc(sizeof(per));

    temp->age = num;
    per *head = one;
    if(NULL == one)
    {
        return temp;
    }
    while(one->next)
    {
        one = one->next;
    }
    one->next = temp;
    return head;
}

per *reverse(per *head)
{
    if(NULL == head)
    {
        return;
    }
    per *p, *q, *r;
    
    p = head;
    q = p->next;
    r = q->next;
    head->next = NULL;
    while(r)
    {
        q->next = p;
        p = q;
        q = r;
        r = r->next;
    }
    q->next = p;
    head = q;

    return head;
}

void show(per *head)
{
    if(NULL == head)
    {
        return;
    }
    while(head)
    {
        printf("age is %d\n",head->age);
        head = head->next;
    }
}

int main()
{
    per *head = NULL;

    head = tail_list(head,10);
    head = tail_list(head,20);
    head = tail_list(head,30);
    head = tail_list(head,40);
    head = tail_list(head,50);
    show(head);
    printf("=================\n");
    head = reverse(head);
    show(head);
    return 0;
}