一个关于vc++链表倒置的程序问题(2)

reverse(struct LIST head);
改成
reverse(head);

NUll
改成
NULL

list->data=rand()%20;
list->next = (i == size-1) ? NULL :(struct LIST*)malloc(sizeof(struct LIST));
list=list->next;

#include"stdio.h"
#include"process.h"
#include"stdlib.h"
#include"time.h"
#define size 10
struct LIST * reverse(struct LIST *head);
struct LIST
{
int data;
struct LIST *next;
}*head,*list,*temp;
void main()
{

int i;
time_t t;
srand((unsigned)time(&t));
list=head=(struct LIST*)malloc(sizeof(struct LIST));
if(list==NULL)
exit(1);
for(i=0;i<size;i++)
{
list->data=rand()%20;
list->next = (i == size-1) ? NULL :(struct LIST*)malloc(sizeof(struct LIST));
list=list->next;
}
list=NULL;
list=head;
puts("\n链表倒置前:");