创建单链表并原地将链表逆序

#include<iostream>
#include<stdio.h>
using namespace std;
#define MAXSIZE 5
#define ERROR -1;
#define CORRECT 1;
typedef struct List{
     int  data;
     struct List *next;
}List;
List *LinkList;
int ShowLinkList(List *L)
{
   List *p;
   if(!L)
    return ERROR;
   p=L;
   cout<<"您创建的链表"<<endl;
   while(p)
   {
       cout<<p->data<<" ";
       p=p->next;
   }
   return CORRECT;
}
void PrintList(List *L)
{
  List *p = L;
  while(p!=NULL)
  {
      cout<<p->data<<endl;
      p=p->next;
  }
}
List *ReverseList(List *L)
{
   if(L==NULL||L->next == NULL)
      return L;
   List *t = NULL,
        *p = L,
        *q = L->next;
   while(q!=NULL)
   {
      t = q->next;
      q->next = p;
      p=q;
      q=t;
   }
   //此时q指向原始链表的最后一个元素，也是逆转后的链表的表头元素*、
   L->next = NULL;
   L =