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

最新推荐文章于 2020-03-12 20:06:02 发布

清汤寡水宋杳杳

最新推荐文章于 2020-03-12 20:06:02 发布

阅读量192

点赞数 1

本文链接：https://blog.csdn.net/qq_41037057/article/details/83187893

版权

#include <stdio.h>
#include <stdlib.h>
struct node
{
    int data;
    struct node *next;
}*p, *q, *tail;
int main()
{
    int n;
    scanf("%d", &n);
    tail = (struct node*)malloc(sizeof(struct node));
    tail->next = NULL;
    q = tail;
    while(n--)
    {
        p = (struct node*)malloc(sizeof(struct node));
        scanf("%d", &p->data);
        p->next = q;
        q = p;
    }
    while(q->next)
    {
        printf("%d ", q->data);
        q = q->next;
    }
    printf("\n");
    return 0;
}