题解 | #牛牛的单向链表#

#include <stdio.h>
#include<stdlib.h>
typedef struct node
{
    int data;
    struct node *next;
}node;
node* add_head()
{
    node* head=(node*)malloc(sizeof(node));
    head->next=NULL;
    head->data;
    return head;
}

void print(node* head)
{
    node *p=head->next;
    while(p!=NULL)
    {
        printf("%d ",p->data);
        p=p->next;
    }
}
node *add_newnode(node *head)
{
	node *newnode=(node *)malloc(sizeof(node));
	newnode->next=NULL;
	node *p=head;
	while(p->next!=NULL)
	p=p->next;
	p->next=newnode;
	return newnode;
}


int main() {
    node* head=add_head();
    int len;
    scanf("%d",&len);
    for(int i=0;i<len;i++)
    {
        int num;
        scanf("%d",&num);
        node *newnode=add_newnode(head);
        newnode->data=num;
    }
    print(head);
    
    return 0;
}