头插法建立、输出单向链表的案例

#include<stdio.h>
#include<stdlib.h>
struct obj
{
    int num;
    struct obj *next;
};
int main(int argc, char *argv[])
{
    int n,i,t;
    struct obj *head=NULL,*temp=NULL,*p=NULL;

    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&t);
        temp=(struct obj *)malloc(sizeof(struct obj));
        temp->num=t;
        temp->next=NULL;

        temp->next=head;
        head=temp;
    }

    p=head;
    while(p!=NULL)
    {
        printf("%d ",p->num);
        p=p->next;
    }
    printf("\n");
    return 0;
}