学步园

#include<iostream>
using namespace std;

typedef struct node
{
 int a;
 struct node *next;
} Tnode;

int main()
{

  Tnode ka[4];
  for(int i=0;i<3;i++)
    {
      ka[i].next=&ka[i+1];
      ka[i].a=i+1;
    }
  ka[3].next=NULL;
  ka[3].a=4;

  Tnode *p=&ka[0];
  Tnode *p2=p->next;
  Tnode *temp=NULL;
  
  while(p2!=NULL)
   {
     temp=p2->next;
     p2->next=p;
     p=p2;
     p2=temp;
   }
  ka[0].next=NULL;

  p=&ka[3];

  while(p!=NULL)
   {
     cout<<p->a<<" ";
     p=p->next;
   }

   cout<<endl;

   return 0;

}