输入若干个正整数（输入-1为结束标志），要求按输入数据的逆序建立一个链表，并输出。
输入输出示例：
1    2    3    4    5    6    7    -1
7    6    5    4    3    2    1

#include <stdio.h>
main()
{
    int i, a[10];
    for (i=0; i<10&&scanf("%d",&a[i])==1&&a[i]>0; ++i);
    for (--i; i>=0; --i)
        printf("%d ", a[i]);
}

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

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

void list_push_front( struct node** plist, int value )
{
    struct node* tmp = *plist;
    (*plist) = malloc( sizeof(struct node) );
    (*plist)->value = value;
    (*plist)->next = tmp;
}

int main( void )
{
    struct node* list = NULL;
    for( int val; scanf("%d",&val)==1 && val!=-1; )
        list_push_front( &list, val );

    for( struct node* p=list; p; p=p->next )
        printf( "%d ", p->value );
}

要想作弊，还可以用递归

#include <stdio.h>

void foo( void )
{
    int val;
    if( scanf("%d",&val)==1 && val!=-1 )
    {
        foo();
        printf( "%d ", val );
    }
}

int main( void )
{
    foo();
}

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

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

node *creat();  //创建链表
void show(node *head);  // 显示链表

int main()
{
    node *h = creat();
    show(h);
    system("pause");
    return 0;
}

node *creat()
{
    int a;
    node *head = (node*)malloc(sizeof(node));
    head->next = NULL;
    while (1)
    {
        node *p = (node*)malloc(sizeof(node));
        if (p)
        {
            printf( "请输入元素值:\n");
            scanf("%d",&a);
            p->data = a;
            if (p->data == -1)
                break;
            p->next = head->next;
            head->next = p;
        }
    }
    return head;
}

void show(node *head)
{
    node *p = head->next;
    while (p)
    {
        printf("%d -> ", p->data);
        p = p->next;
    }
    printf("\n");
}