#include <iostream>
#include <stdlib.h>
using namespace std;
typedef struct node
{
int num;
struct node* next;
struct node* piror;
}NODE,*PNODE;
PNODE creat_(int n)
{
int num_;
PNODE head,p,q;
head=(PNODE)malloc(sizeof(NODE));
if(head==NULL)
{
cout<<"fault";
}
head->next=NULL;
q=head;
while(n--)
{
p=(PNODE)malloc(sizeof(NODE));
cin>>num_;
p->num=num_;
q->next=p;
p->piror=q;
q=p;
}
q->next=head;
return head;
}
void traverse(PNODE head)
{
PNODE q=head->next;
while(q!=head)
{
cout<<q->num<<' ';
q=q->next;
}
}
void shift(PNODE head)
{
PNODE q=head;
PNODE temp1,temp2;
int i=1;
for(i=1;i<3;i++)
{
q=q->next;
}
temp1=q->next;
temp2=q->next->next;
q->next=temp2;
temp2->piror=q;
temp1->next=temp2->next;
temp1->piror=temp2;
temp2->next=temp1;
}
int main()
{
PNODE head;
head=creat_(10);
shift(head);
traverse(head);
}
16-20
最新推荐文章于 2022-10-16 22:46:40 发布