求解C++矩阵逆置的算法？？？？？

#include<iostream>
using namespace std;
int main()
{
typedef struct linklist
{
int data;
struct linklist *next;
}linklist;
char ch;
int x;
linklist *heada,*headb,*p,*r;
p=(linklist*)malloc(sizeof(linklist));
p->next=NULL;
heada=p;
r=p;
ch=getchar();
while(ch!='?')
{
cin>>x;
p=(linklist*)malloc(sizeof(linklist));
p->next=NULL;
p->data=x;
r->next=p;
r=p;
ch=getchar();
}
p=heada->next;
while(p!=NULL)
{
cout<<p->data<<" ";
p=p->next;
}
p=(linklist*)malloc(sizeof(linklist));
p->next=NULL;
headb=p;
while(heada->next!=NULL)
{
r=heada->next;
heada->next=r->next;
r->next=headb->next;
headb->next=r;
}
p=headb->next;
// p的输出
while(p!=NULL)
{
cout<<p->data<<endl;
p=p->next;
}
return 0;
}