无聊的链表

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

typedef struct NotHeadLinkList
{
    int data;
    struct NotHeadLinkList * next;
}NotHeadLinkList;

NotHeadLinkList * h, * t, * s = NULL;               // 头指针、尾指针

int main()
{
    int i , n , num;
    for(i = 0; i < 10; i++)                        //头插法,无头结点的链表
    {
        t = (NotHeadLinkList *)malloc(sizeof(NotHeadLinkList));
        t -> data = i + 1;
        t -> next = s;
        s = t;
    }

    while(t)
    {
        printf("%d ",t -> data);
        t = t -> next;
    }
    return 0;
}