数据结构-建里链表-C

最新推荐文章于 2024-08-06 13:19:24 发布

S-D-C-L-Yourn

最新推荐文章于 2024-08-06 13:19:24 发布

阅读量177

点赞数 2

分类专栏：数据结构文章标签： C C语言

本文链接：https://blog.csdn.net/qq_41436122/article/details/83018466

版权

数据结构专栏收录该内容

2 篇文章 0 订阅

订阅专栏

数据结构实验之链表一：顺序建立链表

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

struct node
{
    int data;
    struct node *next;
};

int main()
{
    int n, i;
    scanf("%d", &n);
    struct node *head, *tail, *p;
    head = (struct node *)malloc(sizeof(struct node));
    tail = head;
    for(i = 0; i < n; i++ )
    {
        p = (struct node *)malloc(sizeof(struct node));
        scanf("%d", &p ->data);
        p ->next = NULL;
        tail ->next = p;
        tail = p;
    }
    p = head ->next;
    while(p)
    {
        if(p)
            printf("%d ", p ->data);
        else
            printf("%d\n", p ->data);
        p = p ->next;
    }
    return 0;
}

数据结构实验之链表二：逆序建立链表

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

struct node
{
    int data;
    struct node *next;
};

int main()
{
    int n, i;
    scanf("%d", &n);
    struct node *head, *p;
    head = (struct node *)malloc(sizeof(struct node));
    head ->next = NULL;
    for(i = 0; i < n; i++ )
    {
        p = (struct node *)malloc(sizeof(struct node));
        scanf("%d", &p ->data);
        p ->next = head ->next;
        head ->next = p;
    }
    p = head ->next;
    while(p)
    {
        if(p)
            printf("%d ", p ->data);
        else
            printf("%d\n", p ->data);
        p = p ->next;
    }
    return 0;
}