#include <iostream>
#include <stdlib.h>
#define MAX 8
using namespace std;
typedef struct node
{
int num;
struct node* pnext;
}qnode,*pnode;
pnode init()
{
int num_;
int size=MAX;
pnode head,p,q;
head=(pnode)malloc(sizeof(qnode));
head->pnext=NULL;
q=head;
cin>>num_;
head->num=num_;
size--;
while(size--)
{
p=(pnode)malloc(sizeof(qnode));
cin>>num_;
p->num=num_;
q->pnext=p;
q=p;
}
q->pnext=head;
return head;
}
void traverse(pnode head)
{
pnode q=head;
int i=0;
for(i=0;i<MAX;i++)
{
cout<<q->num;
q=q->pnext;
}
}
pnode find(pnode head,int i)
{
pnode p=head;
int j=1;
for(j=1;j<(i-1);j++)
{
p=p->pnext<<' ';
}
return p;
}
void judge(pnode head,int i)
{
int k=MAX;
pnode pra=head,p;
if(i==1)
{
traverse(head);
}
else
{
while(k--)
{
pra=find(pra,i);
p=pra->pnext;
pra->pnext=p->pnext;
pra=p->pnext;
cout<<p->num<<' ';
free(p);
}
}
}
int main()
{
int i=1;
pnode head;
head=init();
judge(head,i);
}
3.10
最新推荐文章于 2024-07-02 18:32:41 发布