2.c

来自「中南的数据结构试验1」· C语言 代码 · 共 63 行

#include<stdio.h>
#include<malloc.h>
#define null 0
#define len sizeof(struct polynode)
typedef struct polynode
{int value;
 struct polynode *next;
 }*polypointer;
polypointer init(void)
{ polypointer t;
  t=(polypointer)malloc(len);
  t->next=t;
  return t;
}
polypointer attach(v,t)
int v; polypointer t;
{polypointer temp;
 temp=(polypointer)malloc(len);
 temp->value=v;
 temp->next=t->next;
 t->next=temp;
 return t;
}

void out(polypointer tail)
{polypointer temp,first;
 temp=tail->next;
 first=temp->next;
 temp->next=first->next;
 free((void *)first);
}
void print(polypointer tail)
{polypointer temp;
 temp=tail->next;
 if(temp->next==tail->next) printf("NONE OF CHARS!");
 while(temp->next!=tail->next)
 {printf("%d",temp->next->value);
  temp=temp->next;
 }
}
main()
{
polypointer tail,temp;
int v,c;
do{
   printf("\n1.init\n2.attach\n3.out\n4.print\n others qiut.\n");
   scanf("%d",&c);
   switch(c)
   {case 1:tail=init();break;
    case 2:printf("\nInput the number:");
	   scanf("%d",&v);
	   tail=attach(v,tail);
	   break;
    case 3:out(tail);break;
    case 4:print(tail);break;
    defult:break;
    }
   }while(c<=4);
}